| Title: |
The Quest for Faster Join Algorithms (Invited Talk) |
| Authors: |
Koutris, Paraschos; Deep, Shaleen; Fan, Austen; Zhao, Hangdong |
| Contributors: |
Paraschos Koutris and Shaleen Deep and Austen Fan and Hangdong Zhao |
| Publisher Information: |
Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
| Publication Year: |
2025 |
| Collection: |
DROPS - Dagstuhl Research Online Publication Server (Schloss Dagstuhl - Leibniz Center for Informatics ) |
| Subject Terms: |
Conjunctive Queries; Joins; Tree Decompositions; Enumeration; Semirings |
| Description: |
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. |
| Document Type: |
article in journal/newspaper; conference object |
| File Description: |
application/pdf |
| Language: |
English |
| Relation: |
Is Part Of LIPIcs, Volume 328, 28th International Conference on Database Theory (ICDT 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2025.1 |
| DOI: |
10.4230/LIPIcs.ICDT.2025.1 |
| Availability: |
https://doi.org/10.4230/LIPIcs.ICDT.2025.1; https://nbn-resolving.org/urn:nbn:de:0030-drops-229428; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2025.1 |
| Rights: |
https://creativecommons.org/licenses/by/4.0/legalcode |
| Accession Number: |
edsbas.3618E150 |
| Database: |
BASE |