2026-08-20T01:17:05Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:22942 2025-10-02T12:19:16Z ddc:004 open_access

The Quest for Faster Join Algorithms (Invited Talk) Koutris, Paraschos Deep, Shaleen Fan, Austen Zhao, Hangdong Conjunctive Queries Joins Tree Decompositions Enumeration Semirings Joins are the cornerstone of relational databases. Surprisingly, even after several decades of research in the systems and theory database community, we still lack an understanding of how to design the fastest possible join algorithm. In this talk, we will present the exciting progress the database theory community has achieved in join algorithms over the last two decades. The talk will revolve around five key ideas fundamentally shaping this research area: tree decompositions, data partitioning, leveraging statistical information, enumeration, and algebraic techniques. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Paraschos Koutris and Shaleen Deep and Austen Fan and Hangdong Zhao 2025 Is Part Of LIPIcs, Volume 328, 28th International Conference on Database Theory (ICDT 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICDT.2025.1 urn:nbn:de:0030-drops-229428 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2025.1 eng https://creativecommons.org/licenses/by/4.0/legalcode