Hash-merge join: A non-blocking join algorithm for producing fast and early join results

Mohamed F. Mokbel, Ming Lu, Walid G. Aref

Research output: Chapter in Book/Report/Conference proceedingConference contribution

86 Scopus citations

Abstract

This paper introduces the hash-merge join algorithm (HMJ, for short); a new non-blocking join algorithm that deals with data items from remote sources via unpredictable, slow, or bursty network traffic. The HMJ algorithm is designed with two goals in mind: (1) Minimize the time to produce the first few results, and (2) Produce join results even if the two sources of the join operator occasionally get blocked. The HMJ algorithm has two phases: The hashing phase and the merging phase. The hashing phase employs an in-memory hash-based join algorithm that produces join results as quickly as data arrives. The merging phase is responsible for producing join results if the two sources are blocked. Both phases of the HMJ algorithm are connected via a flushing policy that flushes in-memory parts into disk storage once the memory is exhausted. Experimental results show that HMJ combines the advantages of two state-of-the-art non-blocking join algorithms (XJoin and Progressive Merge Join) while avoiding their shortcomings.

Original languageEnglish (US)
Title of host publicationProceedings - 20th International Conference on Data Engineering - ICDE 2004
Pages251-262
Number of pages12
Volume20
DOIs
StatePublished - Jun 1 2004
EventProceedings - 20th International Conference on Data Engineering - ICDE 2004 - Boston, MA., United States
Duration: Mar 30 2004Apr 2 2004

Other

OtherProceedings - 20th International Conference on Data Engineering - ICDE 2004
CountryUnited States
CityBoston, MA.
Period3/30/044/2/04

Fingerprint Dive into the research topics of 'Hash-merge join: A non-blocking join algorithm for producing fast and early join results'. Together they form a unique fingerprint.

Cite this