scientific article; zbMATH DE number 7650999

DOI10.4230/LIPICS.ICDT.2020.21MaRDI QIDQ5874375zbMATH OpenFDO

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

zbMATH Keywords

AGM boundcompact data structuresjoin algorithmsquadtrees

Mathematics Subject Classification ID

Database theory (68P15)

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

Cited in

(7)

• Size bounds and query plans for relational joins
• On the optimality of strategies for multiple join
• The ring: worst-case optimal joins in graph databases using (almost) no extra space
• Join sampling under acyclic degree constraints and (cyclic) subgraph sampling
• Subgraph enumeration in optimal I/O complexity
• Join and subgraph sampling under degree constraints
• Parallel acyclic joins: optimal algorithms and cyclicity separation

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)