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)
Incoming Non-self Citations Over Time
Authors
- 1. M Muralikrishna (University of Wisconsin)
- 2. David J. DeWitt (University of Wisconsin)
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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,745 | Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries | 2020 | VLDB |
| 2 | 1,530 | Multiple Query Processing in Deductive Databases using Query Graphs | 1986 | VLDB |
| 3 | 290 | An Overview of Query Optimization in Relational Systems | 1998 | PODS |
| 4 | 3,813 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD |
| 5 | 7,161 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD |
| 6 | 1,740 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 7 | 97 | Efficient Optimization of a Class of Relational Expressions | 1978 | SIGMOD |
| 8 | 143 | Optimization of Nonrecursive Queries | 1986 | VLDB |
| 9 | 2,104 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB |
| 10 | 8,294 | On the Optimality of Strategies for Multiple Joins | 1990 | PODS |