Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/395020
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNurazzah Abd Rahman-
dc.contributor.authorTareg Salahi Saad-
dc.date.accessioned2023-06-15T07:53:49Z-
dc.date.available2023-06-15T07:53:49Z-
dc.identifier.otherukmvital:122730-
dc.identifier.urihttps://ptsldigital.ukm.my/jspui/handle/123456789/395020-
dc.description.abstractText-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.-
dc.language.isoeng-
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE),Piscataway, US-
dc.subjectHash join algorithms-
dc.subjectInformation retrieval-
dc.titleHash join algorithms used in text-based information retrieval: guidelines for users-
dc.typeSeminar Papers-
dc.format.pages7-
dc.identifier.callnoT58.5.C634 2008 kat sem j.2-
dc.contributor.conferencenameInternational Symposium on Information Technology-
dc.coverage.conferencelocationKuala Lumpur Convention Centre-
dc.date.conferencedate26/08/2008-
Appears in Collections:Seminar Papers/ Proceedings / Kertas Kerja Seminar/ Prosiding

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.