• DocumentCode
    1502600
  • Title

    Heap-filter merge join: a new algorithm for joining medium-size inputs

  • Author

    Graefe, Goetz

  • Author_Institution
    Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA
  • Volume
    17
  • Issue
    9
  • fYear
    1991
  • fDate
    9/1/1991 12:00:00 AM
  • Firstpage
    979
  • Lastpage
    982
  • 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;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/32.92919
  • Filename
    92919
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1502600