Guangjun Wu

dblp:21/4046 · DBLP profile ↗
← Back
6ranked-venue papers in the field
3as first author
3since 2021 · last 2022
—ORCID · conflict

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 3 (3 first)Knowledge Engineering, Semantic Web & Information Systems · 3
YearPublicationVenuePosition
2022 Fourier Enhanced MLP with Adaptive Model Pruning for Efficient Federated Recommendation
Zhengyang Ai, Guangjun Wu, Binbin Li 0001, Yong Wang 0032, Chuantong Chen
KSEM (3)2
2022 Towards Better Personalization: A Meta-Learning Approach for Federated Recommender Systems
Zhengyang Ai, Guangjun Wu, Zisen Qi, Yong Wang 0032
KSEM (2)2
2022 Privacy-Preserving Deep Learning in Internet of Healthcare Things with Blockchain-Based Incentive
Wenyuan Zhang 0002, Guangjun Wu, Jun Li 0085
KSEM (3)3
2019 Accelerating Real-Time Tracking Applications over Big Data Stream with Constrained Space
Guangjun Wu, Xiao-chun Yun, Ge Fu, Chao Li 0062, Yong Liu 0018, Binbin Li 0001, Yong Wang 0032
DASFAA (1)1
2017 Supporting Real-Time Analytic Queries in Big and Fast Data Environments
Guangjun Wu, Xiao-chun Yun, Chao Li 0062, Yipeng Wang 0001, Xiaoyu Zhang 0002, Siyu Jia, Guangyan Zhang
DASFAA (2)1
2008 Design and Implementation of Multi-Version Disk Backup Data Merging Algorithm
abstract
Multi-version data management in disk backup and recovery is to manage the temporal attribute of backuped data. It can support to retrieve timestamp (time slice) disk data according to different query type. Exiting multi-version data management algorithms have two shortcomings. First, they are inefficient in multi-time point data query and updating which are adopted by data backup and recovery usually. Second, they use centralized data indexes which are not suitable for backup data management. To overcome these limitations, Backup Data Merging (BDM) algorithm is proposed in this paper, which uses distributed storage structure according to disk data format. By range operation, BDM algorithm can generate timestamp (time slice) data index dynamically. By comparing with traditional algorithms, BDM algorithm achieves high performance in storage utilization and query efficiency.
Guangjun Wu, Xiao-chun Yun
WAIM1