Location-based hashing for querying and searching

UARKive Repository

Show simple item record

dc.creator Ching, Felix 2011-06-01T21:45:42Z 2011-06-01T21:45:42Z 2008-05 2008-05
dc.description.abstract The rapidly growing information technology in modern days demands an efficient searching scheme to search for desired data. Locality Sensitive Hashing (LSH) is a method for searching similar data in a database. LSH achieves high accuracy and precision for locating desired data, but consumes a significant amount of memory and time. Based on LSH, this thesis presents two novel schemes for efficient and accurate data searching: Locality Sensitive Hashing-SmithWaterman (LSH-SmithWaterman) and Secure Min-wise Locality Sensitive Hashing (SMLSH). Both methods dramatically reduce the memory and time consumption and exhibit high accuracy in data searching. Simulation results demonstrate the efficiency of the two schemes in comparison with LSH. The schemes dramatically reduce overhead and yields significant improvements on the efficiency of LSH.
dc.subject Computer science
dc.title Location-based hashing for querying and searching
dc.type Thesis Bachelor of Science in Computer Engineering Undergraduate University of Arkansas, Fayetteville Computer Science Computer Science and Computer Engineering

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UARKive

Advanced Search


Admin login