Worst-case optimal join algorithms: [extended abstract]
PODS, pp. 37-48, 2012.
database practicefamous loomis-whitney inequalityworst-case optimalconstructive proofoptimal boundMore(7+)
Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe...More
Full Text (Upload PDF)
Best Paper of PODS, 2012