The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1991 vol.17)
pp: 979-982
ABSTRACT
<p>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.</p>
INDEX TERMS
heap filter merge join; medium-size inputs; novel algorithm; relational equijoin; merge join; medium-size inputs; hybrid hash join; analytic cost functions; database theory; relational databases
CITATION
G. Graefe, "Heap-Filter Merge Join: A New Algorithm for Joining Medium-Size Inputs", IEEE Transactions on Software Engineering, vol.17, no. 9, pp. 979-982, September 1991, doi:10.1109/32.92919
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool