Title :
Heap-filter merge join: a new algorithm for joining medium-size inputs
Author_Institution :
Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA
fDate :
9/1/1991 12:00:00 AM
Abstract :
A novel algorithm for relational equijoin is presented. The algorithm is a modification of merge join, but promises superior performance for medium-size inputs. In many cases it even compares favorably with both merge join and hybrid hash join, which is shown using analytic cost functions
Keywords :
database theory; relational databases; analytic cost functions; heap filter merge join; hybrid hash join; medium-size inputs; merge join; novel algorithm; relational equijoin; Computer science; Cost function; Database systems; Merging; Performance analysis; Probes; Relational databases; Sorting; Writing;
Journal_Title :
Software Engineering, IEEE Transactions on
