DBScholar

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
835
Venue
PODS
Year
1988
Pagerank
5.5305813e-05
Overall Rank
7,858 | 46.09%
DOI
10.1145/308386.308452

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{muralikrishna_pods88,
        address = {New York, NY, USA},
        series = {{PODS} '88},
        title = {{Optimization of Multiple-Relation Multiple-Disjunct Queries}},
        url = {https://dl.acm.org/doi/10.1145/308386.308452},
        doi = {10.1145/308386.308452},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Muralikrishna, M and DeWitt, David J.},
        year = {1988}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,861 Factorizing Complex Predicates in Queries to Exploit Indexes 2003 SIGMOD 6.0636778e-05
8,893 Optimizing Disjunctive Queries with Tagged Execution 2024 SIGMOD 5.3504579e-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.0024089429
519 Optimizing the Performance of a Relational Algebra Database Interface 1975 SIGMOD 0.00017144967
Previous Page 1 / 1 Next

Semantically Similar Papers