Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/49158
Title: Database Theory in Action: Yannakakis' Algorithm
Authors: Koutris, Paraschos
VANSUMMEREN, Stijn 
Wang , Qichen
Wang, Yisu Remy
Yu , Xiangyao
Issue Date: 2026
Publisher: SCHLOSS DAGSTUHL, LEIBNIZ CENTER INFORMATICS
Source: TenCate, B.; Funk, M. (Ed.). 29TH International conference on Database theory, SCHLOSS DAGSTUHL, Leibniz Center Informatics
Abstract: Yannakakis' seminal algorithm is optimal for acyclic joins, yet it has not been widely adopted due to its poor performance in practice. This paper briefly surveys recent advancements in making Yannakakis' algorithm more practical, in terms of both efficiency and ease of implementation, and points out several avenues for future research.
Notes: Koutris, P (corresponding author), Univ Wisconsin, Madison, WI 53706 USA.
Keywords: Join algorithms;acyclicity;Yannakakis' algorithm
Document URI: http://hdl.handle.net/1942/49158
Link to publication/dataset: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2026.25
ISBN: 978-3-95977-413-0
DOI: 10.4230/LIPIcs.ICDT.2026.25
ISI #: 001747306100025
Rights: Paraschos Koutris, Stijn Vansummeren, Qichen Wang, Yisu Remy Wang, and Xiangyao Yu; licensed under Creative Commons License CC-BY 4.0
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
LIPIcs.ICDT.2026.25.pdfPublished version505.66 kBAdobe PDFView/Open
Show full item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.