Thumbnail
Access Restriction
Subscribed

Author Mokbel, M.F. ♦ Lu, M. ♦ Aref, W.G.
Sponsorship Microsoft Res. ♦ bea ♦ IBM ♦ MITRE ♦ Sun Microsystems
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2004
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Data engineering
Abstract We introduce the hash-merge join algorithm (HMJ, for short); a new nonblocking 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 nonblocking join algorithms (XJoin and Progressive Merge Join) while avoiding their shortcomings.
Description Author affiliation: Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA (Mokbel, M.F.; Lu, M.; Aref, W.G.)
ISBN 0769520650
ISSN 10636382
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2004-04-02
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 5.87 MB
Page Count 12
Starting Page 251
Ending Page 262


Source: IEEE Xplore Digital Library