Back to authors
Qizhen Zhang
- Author ID
- u1627
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- University of Pennsylvania
- Pagerank
- 0.11390435
- Overall Rank
- 566 | 97.39%
- Paper Count
- 15
Affiliation Timeline
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing 15 of 15 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 2,350 |
Understanding the Effect of Data Center Resource Disaggregation on Production DBMSs |
2020 |
VLDB |
8.5984201e-05 |
| 3,135 |
Rethinking Data Management Systems for Disaggregated Data Centers |
2020 |
CIDR |
7.6092468e-05 |
| 4,296 |
Redy: Remote Dynamic Memory Cache |
2022 |
VLDB |
6.6805238e-05 |
| 5,293 |
Optimizing Data-intensive Systems in Disaggregated Data Centers with TELEPORT |
2022 |
SIGMOD |
6.1917112e-05 |
| 5,873 |
FlexChain: An Elastic Disaggregated Blockchain |
2023 |
VLDB |
5.9638429e-05 |
| 6,792 |
CompuCache: Remote Computable Caching using Spot VMs |
2022 |
CIDR |
5.6810904e-05 |
| 7,137 |
A General-Purpose Query-Centric Framework for Querying Big Graphs |
2016 |
VLDB |
5.600995e-05 |
| 8,485 |
Optimizing Declarative Graph Queries at Large Scale |
2019 |
SIGMOD |
5.3326349e-05 |
| 8,758 |
DDS: DPU-optimized Disaggregated Storage |
2024 |
VLDB |
5.2837968e-05 |
| 9,687 |
DPDPU: Data Processing with DPUs |
2025 |
CIDR |
5.1408809e-05 |
| 9,852 |
Quegel: A General-Purpose System for Querying Big Graphs |
2016 |
SIGMOD |
5.1196396e-05 |
| 10,515 |
Understanding the Impact of Data Noise in Federated Learning: [Experiments & Analysis] |
2026 |
SIGMOD |
4.9793485e-05 |
| 10,785 |
MGI: A Communication Framework for Data Processing in Massive GPU Infrastructures |
2026 |
VLDB |
4.9793485e-05 |
| 10,807 |
dpKernels: Harvesting DPU Compute Resources for Data-path Efficiency in Cloud Data Processing |
2026 |
VLDB |
4.9793485e-05 |
| 11,676 |
Templating Shuffles |
2023 |
CIDR |
4.9793485e-05 |
Frequent Co-authors
Co-authored at least 5 papers.