Back to authors
Rong Zhu
- Author ID
- u2028
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Alibaba
- Pagerank
- 0.11601815
- Overall Rank
- 556 | 97.44%
- Paper Count
- 13
Affiliation Timeline
-
Alibaba
Most frequent
2019 - 2026
| 13 papers
Incoming Non-self Citations Over Time
Total yearly non-self incoming citations across all papers by this author.
Publications by Paper Pagerank
Showing all 13 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 203 |
AliGraph: A Comprehensive Graph Neural Network Platform |
2019 |
VLDB |
64 |
0.00025234479 |
| 983 |
Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation |
2022 |
VLDB |
80 |
0.00012677179 |
| 2,009 |
FLAT: Fast, Lightweight and Accurate Method for Cardinality Estimation |
2021 |
VLDB |
51 |
9.1813272e-05 |
| 2,190 |
Lero: A Learning-to-Rank Query Optimizer |
2023 |
VLDB |
42 |
8.8848923e-05 |
| 2,594 |
GraphScope: A Unified Engine For Big Graph Processing |
2021 |
VLDB |
31 |
8.2278437e-05 |
| 4,315 |
ALECE: An Attention-based Learned Cardinality Estimator for SPJ Queries on Dynamic Workloads |
2024 |
VLDB |
23 |
6.6545412e-05 |
| 4,389 |
DILI: A Distribution-Driven Learned Index |
2023 |
VLDB |
14 |
6.6111249e-05 |
| 5,453 |
Eraser: Eliminating Performance Regression on Learned Query Optimizer |
2024 |
VLDB |
11 |
6.1077838e-05 |
| 5,713 |
PilotScope: Steering Databases with Machine Learning Drivers |
2024 |
VLDB |
12 |
6.0090633e-05 |
| 6,402 |
A Unified Transferable Model for ML-Enhanced DBMS |
2022 |
CIDR |
13 |
5.7800842e-05 |
| 9,348 |
BridgeScope: A Universal Toolkit for Bridging Large Language Models and Databases |
2026 |
CIDR |
2 |
5.1764094e-05 |
| 10,257 |
PRICE: A Pretrained Model for Cross-Database Cardinality Estimation |
2025 |
VLDB |
1 |
5.039379e-05 |
| 11,094 |
Bridging LLMs and Database Systems: A Deep Dive into Enhanced Relational Operators |
2026 |
VLDB |
0 |
4.9605343e-05 |
Frequent Co-authors
Co-authored at least 5 papers.