DBScholar

Back to papers

On the Optimality of Strategies for Multiple Joins

Summary: Characterizes when linear (left-deep) join orders and avoiding Cartesian products suffice for globally optimal multi-join evaluation. Proves three conditions: optimal linear plans can avoid Cartesian products; an optimal no-Cartesian plan exists; and sometimes an optimal plan is both linear and no-Cartesian, certifying restricted-space optimality. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
893
Venue
PODS
Year
1990
Pagerank
5.4574671e-05
Overall Rank
8,294 | 43.10%
DOI
10.1145/298514.298550

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{tay_pods90,
        address = {New York, NY, USA},
        series = {{PODS} '90},
        title = {{On the Optimality of Strategies for Multiple Joins}},
        url = {https://dl.acm.org/doi/10.1145/298514.298550},
        doi = {10.1145/298514.298550},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Tay, Y.C.},
        year = {1990}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
13,084 Avoiding Cartesian Products in Programs for Multiple Joins (Extended Abstract) 1992 PODS 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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