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

DOI10.1016/j.jcss.2016.05.005zbMath1350.68089OpenAlexW2425257096MaRDI QIDQ736613

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)

Related Items

Unnamed Item

Cites Work

• 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
• On the Complexity of Testing Implications of Functional and Join Dependencies
• I/O-Efficient Algorithms on Triangle Listing and Counting
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item