Back to papers
AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions
Summary: AniPQO is a heuristic parametric query optimization technique for nonlinear cost functions. It is almost non-intrusive, reuses an existing optimizer with minor modifications, scales to four parameters, and yields region-aware plans that perform well on TPC-D.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 9022
- Venue
- VLDB
- Year
- 2003
- Pagerank
- 9.8536784e-05
- Overall Rank
- 1,986 | 86.19%
- DOI
-
-
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 21 of 21 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 1,070 |
Analyzing Plan Diagrams of Database Query Optimizers |
2005 |
VLDB |
0.00014316791 |
| 1,272 |
Proactive Re-Optimization |
2005 |
SIGMOD |
0.00012920076 |
| 1,300 |
The Picasso Database Query Optimizer Visualizer |
2010 |
VLDB |
0.00012733214 |
| 2,484 |
Efficient Use of the Query Optimizer for Automated Physical Design |
2007 |
VLDB |
8.6864279e-05 |
| 2,659 |
Multi-Objective Parametric Query Optimization |
2015 |
VLDB |
8.3604734e-05 |
| 3,340 |
Toward Computational Fact-Checking |
2014 |
VLDB |
7.2030091e-05 |
| 3,474 |
Solving the Join Ordering Problem via Mixed Integer Linear Programming |
2017 |
SIGMOD |
7.0625972e-05 |
| 4,045 |
Optimizing Nested Queries with Parameter Sort Orders |
2005 |
VLDB |
6.4985218e-05 |
| 4,348 |
Identifying Robust Plans through Plan Diagram Reduction |
2008 |
VLDB |
6.2660237e-05 |
| 4,617 |
Adaptive Query Processing in the Looking Glass |
2005 |
CIDR |
6.0446738e-05 |
| 5,340 |
Efficiently Approximating Query Optimizer Plan Diagrams |
2008 |
VLDB |
5.5623066e-05 |
| 5,466 |
On the Production of Anorexic Plan Diagrams |
2007 |
VLDB |
5.4909203e-05 |
| 6,479 |
Leveraging Re-costing for Online Optimization of Parameterized Queries with Guarantees |
2017 |
SIGMOD |
5.0483805e-05 |
| 6,561 |
On the Stability of Plan Costs and the Costs of Plan Stability |
2010 |
VLDB |
5.0099895e-05 |
| 6,667 |
Leveraging Query Logs and Machine Learning for Parametric Query Optimization |
2022 |
VLDB |
4.9688874e-05 |
| 7,776 |
Plan Stitch: Harnessing the Best of Many Plans |
2018 |
VLDB |
4.6537231e-05 |
| 8,639 |
A Concave Path to Low-overhead Robust Query Processing |
2018 |
VLDB |
4.4793681e-05 |
| 9,305 |
Parallelizing Query Optimization on Shared-Nothing Architectures |
2016 |
VLDB |
4.3577129e-05 |
| 9,693 |
ROME: Robust Query Optimization via Parallel Multi-Plan Execution |
2024 |
SIGMOD |
4.3027391e-05 |
| 10,050 |
APQO: An Adaptive Framework for Parametric Query Optimization |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,880 |
RankPQO: Learning-to-Rank for Parametric Query Optimization |
2025 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,070 |
Analyzing Plan Diagrams of Database Query Optimizers |
2005 |
VLDB |
0.00014316791 |
| 10,050 |
APQO: An Adaptive Framework for Parametric Query Optimization |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,219 |
Practical Parameterized Query Optimization via Efficient Plan Reuse and List-wise Ranking |
2026 |
SIGMOD |
4.1945683e-05 |
| 4,874 |
Approximation Schemes for Many-Objective Query Optimization |
2014 |
SIGMOD |
5.8594632e-05 |
| 3,462 |
Efficient and Provable Multi-Query Optimization |
2017 |
PODS |
7.0703696e-05 |
| 5,075 |
An Incremental Anytime Algorithm for Multi-Objective Query Optimization |
2015 |
SIGMOD |
5.7172118e-05 |
| 6,479 |
Leveraging Re-costing for Online Optimization of Parameterized Queries with Guarantees |
2017 |
SIGMOD |
5.0483805e-05 |
| 1,726 |
Design and Analysis of Parametric Query Optimization Algorithms |
1998 |
VLDB |
0.00010741411 |
| 2,659 |
Multi-Objective Parametric Query Optimization |
2015 |
VLDB |
8.3604734e-05 |
| 1,647 |
Parametric Query Optimization for Linear and Piecewise Linear Cost Functions |
2002 |
VLDB |
0.00011033757 |