Sediyono, Agung and Ku-Mahamud, Ku Ruhana (2008) New bloom filter architecture for string matching. In: Knowledge Management International Conference 2008 (KMICe2008), 10-12 June 2008, Langkawi, Malaysia.

PDF Restricted to Registered users only Download (39kB) | Request a copy

Abstract

Implementation of the Bloom filter for plagiarism detection in full text document has a problem on how to identify the same terms from different location.Location identifier can be hashed in offline mode since the collection is static.By this approach, the computation speed of the Bloom filter can be improved.Two new Bloom filter architectures are proposed in this study to overcome the problem of computational time.First architecture concatenates hash code of the string and its location identifier, while the second architecture concatenates the bit position of the string and its location identifier.Analysis was conducted to evaluate the proposed architectures in terms of computation time.From the result, computation time can be reduced if the location identifiers are hashed offline.

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	ISBN 978-983-3827-73-2 Organized by: College of Arts and Sciences, Universiti Utara Malaysia
Uncontrolled Keywords:	Bloom Filter, Ccomputation Speed, Location Identifier
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Divisions:	College of Arts and Sciences
Depositing User:	Prof. Dr. Ku Ruhana Ku Mahamud
Date Deposited:	24 Jul 2014 03:48
Last Modified:	24 Jul 2014 03:48
URI:	https://repo.uum.edu.my/id/eprint/11363

Actions (login required)

View Item