Efficient Processing of Acyclic Queries

PhD Qualifying Examination


Title: "Efficient Processing of Acyclic Queries"

by

Miss Bingnan CHEN


Abstract:

The surge in data-intensive applications, coupled with massive volumes of 
data generated across industrial and academic domains, has placed significant 
demands on database management systems (DBMS) and their query processing 
engines. Complex analytical queries involving joins across multiple relations 
are now commonplace, with acyclic queries constituting a significant portion 
has become a critical research and practical challenge.

This survey introduces the theoretical foundations of query decomposition and 
related complexity measures for acyclic queries, then explores specialized 
join algorithms that exploit acyclicity, with particular emphasis on the 
Yannakakis algorithm and its variants. Finally, we discuss system-level 
implementations and optimizations that realize these theoretically guaranteed 
algorithms in practice.


Date:                   Monday, 15 September 2025

Time:                   3:00pm - 4:00pm

Venue:                  Room 1104
                        Lift 19

Committee Members:      Prof. Ke Yi (Supervisor)
                        Prof. Dimitris Papadias (Chairperson)
                        Prof. Raywong Wong