Back to authors
Zechao Shang
- Author ID
- u1120
- ORCID
-
-
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- University of Chicago
- Pagerank
- 0.1049132
- Overall Rank
- 646 | 97.03%
- Paper Count
- 14
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 all 14 publications. Total citations include self and non-self citations.
| Rank |
Title |
Year |
Venue |
Total Citations |
Pagerank |
| 2,617 |
K-Reach: Who is in Your Small World |
2012 |
VLDB |
11 |
8.2001569e-05 |
| 4,395 |
Graph Analytics Through Fine-Grained Parallelism |
2016 |
SIGMOD |
11 |
6.6078819e-05 |
| 6,198 |
Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing |
2021 |
SIGMOD |
11 |
5.8362492e-05 |
| 6,807 |
Intermittent Query Processing |
2019 |
VLDB |
11 |
5.661199e-05 |
| 6,835 |
CrocodileDB: Efficient Database Execution through Intelligent Deferment |
2020 |
CIDR |
6 |
5.6527238e-05 |
| 7,680 |
CYADB: A Database that Covers Your Ask |
2018 |
VLDB |
1 |
5.4565877e-05 |
| 7,741 |
Resource-efficient Shared Query Execution via Exploiting Time Slackness |
2021 |
SIGMOD |
3 |
5.4469162e-05 |
| 8,154 |
Thrifty Query Execution via Incrementability |
2020 |
SIGMOD |
6 |
5.3732833e-05 |
| 8,192 |
Fast and Reliable Missing Data Contingency Analysis with Predicate-Constraints |
2020 |
SIGMOD |
5 |
5.3646457e-05 |
| 9,354 |
CrocodileDB in Action: Resource-Efficient Query Execution by Exploiting Time Slackness |
2020 |
VLDB |
1 |
5.1751422e-05 |
| 9,939 |
Auto-Approximation of Graph Computing |
2014 |
VLDB |
1 |
5.0932503e-05 |
| 9,976 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
2 |
5.0881951e-05 |
| 10,112 |
RushMon: Real-time Isolation Anomalies Monitoring |
2018 |
SIGMOD |
1 |
5.0667359e-05 |
| 12,310 |
My Weak Consistency is Strong: When Bad Things Do Not Come in Threes |
2017 |
CIDR |
0 |
4.9605343e-05 |
Frequent Co-authors
Co-authored at least 5 papers.