Efficient locality-sensitive hashing over high-dimensional streaming data

Approximate nearest neighbor (ANN) search in high-dimensional spaces is fundamental in many applications. Locality-sensitive hashing (LSH) is a well-known methodology to solve the ANN problem. Existing LSH-based ANN solutions typically employ a large number of individual indexes optimized for searching efficiency. Updating such indexes might be impractical when processing high-dimensional streaming data. In this paper, we present a novel disk-based LSH index that offers efficient support for both searches and updates. The contributions of our work are threefold. First, we use the write-friendly LSM-trees to store the LSH projections to facilitate efficient updates. Second, we develop a novel estimation scheme to estimate the number of required LSH functions, with which the disk storage and access costs are effectively reduced. Third, we exploit both the collision number and the projection distance to improve the efficiency of candidate selection, improving the search performance with theoretical guarantees on the result quality. Experiments on four real-world datasets show that our proposal outperforms the state-of-the-art schemes.

Automated summary

This paper presents a novel disk-based LSH index that provides efficient support for both searches and updates. By utilizing write-friendly LSM trees to store LSH projections and developing a novel estimation scheme, the efficiency of search and the cost-effectiveness of disk storage and access are improved. Experimental results demonstrate that the proposed method outperforms state-of-the-art schemes on four real-world datasets.