The Theory and Practice of Join Algorithms

PhD Qualifying Examination


Title: "The Theory and Practice of Join Algorithms"

by

Mr. Xiao HU


Abstract:

Join is a fundamental relational operator in relational databases. The 
main intention of this survey is to provide a general review and analysis 
of join algorithms, from both practical and theoretical perspectives. In 
practice, database systems aim at optimizing a given join query on a 
particular database instance, by estimating various intermediate costs and 
choosing the best execution plan. This is often done by assuming certain 
statistics have been collected on the database instance prior to the 
query. On the other hand, theoretical studies on join algorithms mostly 
focus on analyzing their performance regardless of the database instance. 
This survey will begin with some preliminary knowledge. Then we will 
review both sequential algorithms and parallel algorithms for computing 
joins. Future work will be discussed at last.


Date:			Monday, 29 February 2016

Time:                  	10:00am - 12:00noon

Venue:                  Room 1504
                         Lifts 25/26

Committee Members:	Dr. Ke Yi (Supervisor)
 			Prof. Mordecai Golin (Chairperson)
 			Dr. Sunil Arya
 			Dr. Qiong Luo


**** ALL are Welcome ****