Date of Graduation
5-2008
Document Type
Thesis
Degree Name
Bachelor of Science in Computer Engineering
Degree Level
Undergraduate
Department
Computer Science and Computer Engineering
Advisor/Mentor
Not available
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.
Citation
Ching, F. (2008). Location-Based Hashing for Querying and Searching. Computer Science and Computer Engineering Undergraduate Honors Theses Retrieved from https://scholarworks.uark.edu/csceuht/17
