scientific article; zbMATH DE number 7650999

DOI10.4230/LIPICS.ICDT.2020.21MaRDI QIDQ5874375FDOQ5874375

Authors: Juan L. Reutter, Javiel Rojas-Ledesma, Gonzalo Navarro 

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/1908.01812

Title of this publication is not available (Why is that?)

Recommendations

• Worst-case optimal join algorithms
• On the optimality of strategies for multiple join
• scientific article; zbMATH DE number 4049161
• Access Path Optimization in Relational Joins
• Efficient Approximations of Conjunctive Queries
• Optimal distributed execution of join queries
• I/O-efficient similarity join
• I/O-efficient similarity join

zbMATH Keywords

compact data structuresquadtreesjoin algorithmsAGM bound

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (3)

• On the optimality of strategies for multiple join
• Size bounds and query plans for relational joins
• The ring: worst-case optimal joins in graph databases using (almost) no extra space

This page was built for publication:

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