An intelligent Locally Sensitive Hashing based algorithm for data searching

The rapid growth of information nowadays makes efficient information searching increasingly important for a massive database with tremendous volume of information. Locally Sensitive Hashing (LSH) is an efficient method for searching similar records. This paper analyzes the strengths and weaknesses of LSH in a massive database and Smith-Waterman algorithm. It reveals the strengths of LSH and Smith-Waterman algorithm in the field of database searching and querying. More importantly, this paper presents an intelligent searching algorithm called LSH-SmithWaterman that intelligently integrates LSH and Smith-Waterman algorithm to utilize their strengths and exploit their fullest capacities. Simulation results show the superiority of LSH-SmithWaterman algorithm compared to LSH in information searching. It dramatically reduces the memory and time consumption and performs accurate searching.