Back to authors
Tarique Siddiqui
- Author ID
- o0009-0002-0866-7275
- ORCID
-
0009-0002-0866-7275
- Links
-
(found by gpt-5.6-luna on jul 24 2026)
- Most Frequent Institution
- Microsoft
- Pagerank
- 0.10194442
- Overall Rank
- 669 | 96.91%
- Paper Count
- 13
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 13 of 13 publications.
| Rank |
Title |
Year |
Venue |
Pagerank |
| 924 |
Effortless Data Exploration with zenvisage: An Expressive and Interactive Visual Analytics System |
2017 |
VLDB |
0.00013057136 |
| 2,834 |
Cost Models for Big Data Query Processing: Learning, Retrofitting, and Our Findings |
2020 |
SIGMOD |
7.9560627e-05 |
| 4,968 |
Budget-aware Index Tuning with Reinforcement Learning |
2022 |
SIGMOD |
6.3348803e-05 |
| 5,587 |
ShapeSearch: A Flexible and Efficient System for Shape-based Exploration of Trendlines |
2020 |
SIGMOD |
6.0754379e-05 |
| 5,630 |
ISUM: Efficiently Compressing Large and Complex Workloads for Scalable Index Tuning |
2022 |
SIGMOD |
6.0582762e-05 |
| 6,517 |
Fast-Forwarding to Desired Visualizations with zenvisage |
2017 |
CIDR |
5.7585571e-05 |
| 7,157 |
Sibyl: Forecasting Time-Evolving Query Workloads |
2024 |
SIGMOD |
5.5972283e-05 |
| 7,900 |
DISTILL: Low-Overhead Data-Driven Techniques for Filtering and Costing Indexes for Scalable Index Tuning |
2022 |
VLDB |
5.4303143e-05 |
| 9,637 |
QURE: AI-Assisted and Automatically Verified UDF Inlining |
2025 |
SIGMOD |
5.1462239e-05 |
| 9,663 |
ShapeSearch: Flexible Pattern-based Querying of Trend Line Visualizations |
2018 |
VLDB |
5.1453267e-05 |
| 10,189 |
COMPARE: Accelerating Groupwise Comparison in Relational Databases for Data Analytics |
2021 |
VLDB |
5.0651993e-05 |
| 10,297 |
Wred: Workload Reduction for Scalable Index Tuning |
2024 |
SIGMOD |
5.0430432e-05 |
| 11,666 |
Cache-Efficient Top-k Aggregation over High Cardinality Large Datasets |
2024 |
VLDB |
4.9793485e-05 |
Frequent Co-authors
Co-authored at least 5 papers.