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

DOI10.1016/J.JCSS.2016.05.005zbMATH Open1350.68089OpenAlexW2425257096MaRDI QIDQ736613FDOQ736613

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

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

zbMATH Keywords

external memoryjoin dependencyLoomis-Whitney jointriangle enumeration

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Size bounds and query plans for relational joins
• On the Complexity of Testing Implications of Functional and Join Dependencies
• Title not available (Why is that?)
• On the computational complexity of cardinality constraints in relational databases
• Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-hard
• I/O-efficient algorithms on triangle listing and counting

Cited In (1)

• Title not available (Why is that?)

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)