Divide-and-Conquer algorithm for computing set containment joins

DOI10.1007/3-540-45876-X_28MaRDI QIDQ3044411zbMATH OpenFDO

Authors Sergey Melnik, Hector Garcia-Molina

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2287/22870427.htm

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• The join algorithms on a shared-memory multiprocessor database machine
• A distributed join algorithm
• Performance analysis of the algorithms for the ``outer-join operator evaluation
• Set query optimization in distributed database systems
• On the complexity of division and set joins in the relational algebra

Cited in

(2)

• Divide and conquer roadmap for algebraic sets
• scientific article; zbMATH DE number 5492159 (Why is no real title available?)

This page was built for publication: Divide-and-Conquer algorithm for computing set containment joins

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