Font Size: a A A

On the design and evaluation of a new order-based join algorithm

Posted on:2011-06-15Degree:M.SType:Thesis
University:University of California, IrvineCandidate:Li, GuangqiangFull Text:PDF
GTID:2448390002465735Subject:Computer Science
Abstract/Summary:
The join operation is one of the most important operations in relational database systems. It has been studied for more than 30 years. The state of the art in join algorithms has been stable for the last decade, with the gold standards remaining essentially the same. Currently, there is an effort at HP Laboratories to develop a new join algorithm that aims to be as good as all other major join algorithms and to be general enough so that mistaken join algorithm choices during compile-time query optimization effectively become "impossible".;In this thesis, this new join algorithm is reviewed and studied experimentally. A design of the new join algorithm based on the UCI computational platform Hyrax is proposed and implemented. The algorithm is then evaluated by analyzing its performance, buffer pool behavior, and the behavioral characteristics. This first study of the new algorithm focuses on ad hoc joins of unordered tables, and the algorithm is compared to implementations of both Grace Hash Join and Hybrid Hash Join.
Keywords/Search Tags:Algorithm, Hash join
Related items