Abstract
Similarity search is a fundamental problem in various multimedia database applications. Due to the phenomenon of “curse of dimensionality”, the performance of many access methods decreases significantly when the dimensionality increases. Approximate similarity search is an alternative solution, and Locality Sensitive Hashing (LSH) is the most popular method for it. Nevertheless, LSH needs to verify a large number of points to get good-enough results, which incurs plenty of I/O cost. In this paper, we propose a new scheme called SortedKey and Early stop LSH (SELSH), which extends the previous SortingKeys-LSH (SK-LSH). SELSH uses a linear order to sort all the compound hash keys. Moreover, during query processing an early stop condition and a limited page number are used to determine whether a page needs to be accessed. Our experiments demonstrate the superiority of the proposed method against two state-of-the-art methods, C2LSH and SK-LSH.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
