Avoiding Cartesian products for multiple joins

DOI10.1145/256292.256296MaRDI QIDQ4371698zbMATH OpenOpenAlexFDO

Authors Shinichi Morishita

Publication date 22 January 1998

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/jacm/1997-44/

zbMATH Keywords

CPF ordering

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• On the optimality of strategies for multiple join
• Size bounds and query plans for relational joins
• Worst-case optimal join algorithms
• Heuristics for join processing using nonclustered indexes

Cited in

(3)

• Revisiting global constraint satisfaction
• Dynamic parallel evaluation of the cross-product set using time-stamps
• scientific article; zbMATH DE number 1945884 (Why is no real title available?)

This page was built for publication: Avoiding Cartesian products for multiple joins

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371698)