|
Published Articles >> Table of Contents >> Abstract
20th International Conference on Data Engineering (ICDE'04)
p. 251
Hash-Merge Join: A Non-blocking Join Algorithm for Producing Fast and Early Join Results
Mohamed F. Mokbel, Purdue University, West Lafayette, IN
Ming Lu, Purdue University, West Lafayette, IN
Walid G. Aref, Purdue University, West Lafayette, IN
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2004.1320002
Send link to a friend
| 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 short-comings.
|
 Additional Information
|
Citation:
Mohamed F. Mokbel, Ming Lu, Walid G. Aref,
"Hash-Merge Join: A Non-blocking Join Algorithm for Producing Fast and Early Join Results,"
icde,
p. 251,
20th International Conference on Data Engineering (ICDE'04),
2004
|
|
