I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration

DOI10.1016/J.JCSS.2016.05.005MaRDI QIDQ736613zbMATH OpenOpenAlexFDO

Authors Xiaocheng Hu, Miao Qiao, Yufei Tao

Publication date 4 August 2016

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2016.05.005

zbMATH Keywords

external memoryjoin dependencyLoomis-Whitney jointriangle enumeration

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Worst-case optimal join algorithms
• Join dependencies in relational-database design
• On the complexity of join dependencies
• Acyclic join dependency and data base projections
• Bounds and algorithms for joins via fractional edge covers

Cites work

• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1559569 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• I/O-efficient algorithms on triangle listing and counting
• On the Complexity of Testing Implications of Functional and Join Dependencies
• On the computational complexity of cardinality constraints in relational databases
• Size bounds and query plans for relational joins
• Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-hard

Cited in

(1)

• scientific article; zbMATH DE number 7566062 (Why is no real title available?)

This page was built for publication: I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration

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