DBScholar

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
3827
Venue
SIGMOD
Year
2006
Pagerank
5.6353412e-05
Overall Rank
7,352 | 49.56%
DOI
10.1145/1142473.1142515

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{zhang_sigmod06,
        title = {{Boolean + Ranking: Querying a Database by K-Constrained Optimization}},
        author = {Zhang, Zhen and Hwang, Seung-won and Chang, Kevin Chen-Chuan and Wang, Min and Lang, Christian A. and Chang, Yuan-chi},
        series = {{SIGMOD} '06},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1142473.1142515},
        url = {https://dl.acm.org/doi/10.1145/1142473.1142515},
        year = {2006}
}

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