Back to authors
William Zhang
- Author ID
- 2105
- ORCID
-
0000-0002-9392-6683
- Links
-
(found by gpt-5.2 on feb 09 2026)
- Most Frequent Institution
- Carnegie Mellon University
- Pagerank
- 0.069210259
- Overall Rank
- 966 | 95.45%
- Paper Count
- 10
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 10 of 10 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 4,240 |
Make Your Database System Dream of Electric Sheep: Towards Self-Driving Operation |
2021 |
VLDB |
6.3318228e-05 |
| 4,590 |
MB2: Decomposed Behavior Modeling for Self-Driving Database Management Systems |
2021 |
SIGMOD |
6.0620053e-05 |
| 6,616 |
Tigger: A Database Proxy That Bounces With User-Bypass |
2023 |
VLDB |
4.9930129e-05 |
| 8,020 |
The Holon Approach for Simultaneously Tuning Multiple Components in a Self-Driving Database Management System with Machine Learning via Synthesized Proto-Actions |
2024 |
VLDB |
4.6040862e-05 |
| 8,082 |
Tastes Great! Less Filling! High Performance and Accurate Training Data Collection for Self-Driving Database Management Systems |
2022 |
SIGMOD |
4.5905454e-05 |
| 8,839 |
BPF-DB: A Kernel-Embedded Transactional Database Management System For eBPF Applications |
2025 |
SIGMOD |
4.4388652e-05 |
| 9,006 |
Hit the Gym: Accelerating Query Execution to Efficiently Bootstrap Behavior Models for Self-Driving Database Management Systems |
2024 |
VLDB |
4.4101482e-05 |
| 9,467 |
Database Gyms |
2023 |
CIDR |
4.3346412e-05 |
| 10,217 |
This is Going to Sound Crazy, But What If We Used Large Language Models to Boost Automatic Database Tuning Algorithms By Leveraging Prior History? We Will Find Better Configurations More Quickly Than Retraining From Scratch! |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,425 |
Automated Database Tuning vs. Human-Based Tuning in a Simulated Stressful Work Environment: A Demonstration of the Database Gym |
2025 |
SIGMOD |
4.1945683e-05 |
Frequent Co-authors
Co-authored at least 5 papers.