Database Paper Browser

Back to papers

Efficient Approximation of Optimization Queries Under Parametric Aggregation Constraints

Summary: OPAC queries optimize under parametric aggregation constraints, selecting tuple sets under limits with parameter constants. Preprocessing and indices enable fast, approximate answers with tunable accuracy guarantees; experiments validate efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9023
Venue
VLDB
Year
2003
Pagerank
5.5796719e-05
Overall Rank
5,299 | 63.14%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
1,262 RankSQL: Query Algebra and Optimization for Relational Top-k Queries 2005 SIGMOD 0.00012986539
4,874 Approximation Schemes for Many-Objective Query Optimization 2014 SIGMOD 5.8594632e-05
7,190 Database Support for Matching: Limitations and Opportunities 2006 SIGMOD 4.8051876e-05
7,888 Scalable Package Queries in Relational Database Systems 2016 VLDB 4.6254226e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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