Continuously Adaptive Similarity Search

Similarity search is the basis for many data analytics techniques, including k-nearest neighbor classification and outlier detection. Similarity search over large data sets relies on i) a distance metric learned from input examples and ii) an index to speed up search based on the learned distance me...

Full description

Bibliographic Details
Main Authors: Zhang, Huayi (Author), Cao, Lei (Author), Yan, Yizhou (Author), Madden, Samuel R (Author), Rundensteiner, Elke A. (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery (ACM), 2021-03-03T20:20:39Z.
Subjects:
Online Access:Get fulltext
LEADER 02593 am a22001933u 4500
001 130067
042 |a dc 
100 1 0 |a Zhang, Huayi  |e author 
100 1 0 |a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory  |e contributor 
700 1 0 |a Cao, Lei  |e author 
700 1 0 |a Yan, Yizhou  |e author 
700 1 0 |a Madden, Samuel R  |e author 
700 1 0 |a Rundensteiner, Elke A.  |e author 
245 0 0 |a Continuously Adaptive Similarity Search 
260 |b Association for Computing Machinery (ACM),   |c 2021-03-03T20:20:39Z. 
856 |z Get fulltext  |u https://hdl.handle.net/1721.1/130067 
520 |a Similarity search is the basis for many data analytics techniques, including k-nearest neighbor classification and outlier detection. Similarity search over large data sets relies on i) a distance metric learned from input examples and ii) an index to speed up search based on the learned distance metric. In interactive systems, input to guide the learning of the distance metric may be provided over time. As this new input changes the learned distance metric, a naive approach would adopt the costly process of re-indexing all items after each metric change. In this paper, we propose the first solution, called OASIS, to instantaneously adapt the index to conform to a changing distance metric without this prohibitive re-indexing process. To achieve this, we prove that locality-sensitive hashing (LSH) provides an invariance property, meaning that an LSH index built on the original distance metric is equally effective at supporting similarity search using an updated distance metric as long as the transform matrix learned for the new distance metric satisfies certain properties. This observation allows OASIS to avoid recomputing the index from scratch in most cases. Further, for the rare cases when an adaption of the LSH index is shown to be necessary, we design an efficient incremental LSH update strategy that re-hashes only a small subset of the items in the index. In addition, we develop an efficient distance metric learning strategy that incrementally learns the new metric as inputs are received. Our experimental study using real world public datasets confirms the effectiveness of OASIS at improving the accuracy of various similarity search-based data analytics tasks by instantaneously adapting the distance metric and its associated index in tandem, while achieving an up to 3 orders of magnitude speedup over the state-of-art techniques. 
655 7 |a Article 
773 |t Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data