Database Theory in Action: Yannakakis' Algorithm

2025-12-31

arXiv.org

AI Summary

Although Yannakakis’ algorithm is theoretically optimal for acyclic join queries, its practical adoption has been limited due to poor real-world performance. This work systematically reviews and integrates recent advances that enhance its engineering practicality, with a focus on improving execution efficiency and simplifying implementation. By synthesizing insights from database theory, acyclic query processing, and algorithm engineering, the study delineates a viable pathway from theoretical optimality to practical deployment. The resulting framework not only offers a fresh perspective on query optimization in modern database systems but also facilitates the real-world application of this classic algorithm.

Technology Category

• Search and Optimization: Algorithm Configuration
• Data Mining & Knowledge Management: Intelligent Query Processing
• Constraint Satisfaction and Optimization: Constraint Learning and Acquisition

Application Category

• Graph Algorithms and Modeling for the Web: Querying, indexing, and retrieval in Web-related graphs
• Semantics and Knowledge: Methods, algorithms and applications for the development of semantic models, knowledge graphs and other forms of structured data models with machine-interpretable semantics
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments

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.

Problem

• Yannakakis' algorithm
• acyclic joins
• practical performance
• database theory

Innovation

• Yannakakis' algorithm
• acyclic joins
• query optimization
• database theory
• practical implementation