Database Paper Browser

Back to papers

Boolean + Ranking: Querying a Database by K-Constrained Optimization

Summary: Proposes OPT* for k-constrained optimization: Boolean constraint + numeric objective in RDBMS. It merges discrete index-space search with continuous optimization, framing queries as A* search over multi-index states with tight heuristics, achieving up to 3 orders of magnitude speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3765
Venue
SIGMOD
Year
2006
Pagerank
4.7210446e-05
Overall Rank
7,468 | 48.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 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.

Previous Page 1 / 1 Next

Semantically Similar Papers