Database Paper Browser

Back to papers

Optimization of Multiple-Relation Multiple-Disjunct Queries

Summary: Merge disjuncts into terms evaluated with one scan per relation to avoid redundant joins/scans in multi-relation, multiple-disjunct queries (no indices assumed). Model scan-minimization as covering a merge graph by minimum complete-merge graphs (NP‑complete); provide polytime algorithms for special classes and a heuristic for the general case. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
836
Venue
PODS
Year
1988
Pagerank
4.6418459e-05
Overall Rank
7,824 | 45.58%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
6,072 Factorizing Complex Predicates in Queries to Exploit Indexes 2003 SIGMOD 5.2257599e-05
9,238 Optimizing Disjunctive Queries with Tagged Execution 2024 SIGMOD 4.3690661e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 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.0040449103
163 Optimizing the Performance of a Relational Algebra Database Interface 1975 SIGMOD 0.00039689347
Previous Page 1 / 1 Next

Semantically Similar Papers