Database Paper Browser

Back to papers

An Incremental Anytime Algorithm for Multi-Objective Query Optimization

Summary: Incremental anytime MOQO algorithm producing progressively better plan sets with low inter-result latency. Explores interactive constraints without regenerating plans, analyzes update/complexity tradeoffs, and evaluates on TPC-H in Postgres. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5034
Venue
SIGMOD
Year
2015
Pagerank
5.7118738e-05
Overall Rank
5,073 | 64.75%
DOI
10.1145/2723372.2746484

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0040465394
14 Online Aggregation 1997 SIGMOD 0.0010813443
439 Query Optimization for Parallel Execution 1992 SIGMOD 0.00023183237
1,151 Blink and It's Done: Interactive Queries on Very Large Data 2012 VLDB 0.00013634671
1,618 Multiobjective Query Optimization 2001 PODS 0.00011125239
2,652 Multi-Objective Parametric Query Optimization 2015 VLDB 8.3662031e-05
3,402 Query Optimizers: Time to Rethink the Contract? 2009 SIGMOD 7.134261e-05
4,189 On the Complexity of Approximate Query Optimization 2002 PODS 6.3681294e-05
4,876 Approximation Schemes for Many-Objective Query Optimization 2014 SIGMOD 5.8544467e-05
5,590 PET: Reducing Database Energy Cost via Query Optimization 2012 VLDB 5.4182957e-05
Previous Page 1 / 1 Next

Semantically Similar Papers