Looking Ahead Makes Query Plans Robust: Making the Initial Case with In-Memory Star Schema Data Warehouse Workloads
Summary: Defines robustness of query evaluation to the plan space and introduces Lookahead Information Passing (LIP) for in-memory star-schema workloads. LIP narrows execution-time variance across left-deep plans, achieving near-optimal performance for all plans under plausible assumptions; evaluated with skew and correlation. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jianqiao Zhu
- 2. Navneet Potti
- 3. Saket Saurabh
- 4. Jignesh M. Patel
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,618 | Adaptive Query Processing in the Looking Glass | 2005 | CIDR | 6.039398e-05 |
| 7,042 | Processing Star Queries on Hierarchically-Clustered Fact Tables | 2002 | VLDB | 4.8483133e-05 |
| 6,683 | Adaptive and Robust Query Execution for Lakehouses at Scale | 2024 | VLDB | 4.9593505e-05 |
| 4,342 | Identifying Robust Plans through Plan Diagram Reduction | 2008 | VLDB | 6.2680535e-05 |
| 10,635 | Robust Plan Evaluation based on Approximate Probabilistic Machine Learning | 2025 | VLDB | 4.1905499e-05 |
| 680 | Towards a Robust Query Optimizer: A Principled and Practical Approach | 2005 | SIGMOD | 0.00018193263 |
| 8,638 | A Concave Path to Low-overhead Robust Query Processing | 2018 | VLDB | 4.4750742e-05 |
| 650 | Robust Query Processing through Progressive Optimization | 2004 | SIGMOD | 0.0001865144 |
| 6,763 | Robustness Metrics for Relational Query Execution Plans | 2018 | VLDB | 4.9291549e-05 |
| 12,299 | Visualizing the robustness of query execution | 2009 | CIDR | 4.1905499e-05 |