By Topic

Hash join algorithms used in text-based information retrieval: Guidelines for users

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rahman, Nurazzah Abd ; Faculty of Information Technology & Quantitative Sciences, Universiti Teknologi MARA, Shah Alam, Selangor, Malaysia ; Saad, Tareq Salahi

Text-Based Information Retrieval (IR) is a field where the search in a large document is a basic concept. Concise queries are very fundamentals process in order to satisfy user’s need for information. One of the basic fundamental techniques in IR to implement queries is Hashing. Different types of hashing algorithms are used in IR. This paper discussed about guidelines for users who are implementing Hash join algorithm variations in their IR applications. Algorithms are varied based on its techniques involved in join operations. Three different variations of hash join algorithm, namely, XJoin algorithm, Hash Merge Join (HMJ) algorithm, and Early Hash Join (EHJ) algorithm are studied experimentally. Analysis on the results obtained is given. A user guideline based on three factors: overall execution time, response time and input/output operations performed are presented.

Published in:

Information Technology, 2008. ITSim 2008. International Symposium on  (Volume:2 )

Date of Conference:

26-28 Aug. 2008