Continuously Adaptive Similarity Search

Summary: Continuously adaptive similarity search via OASIS, avoiding full re-indexing as the distance metric evolves. LSH invariance lets the original index stay effective under metric updates; incremental re-hashing and metric learning yield up to 1,000x speedups with accuracy preserved. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 5876
Venue: SIGMOD
Year: 2020
Pagerank: 6.0679671e-05
Overall Rank: 5,846 | 59.90%
DOI: 10.1145/mod0251

Incoming Non-self Citations Over Time

Authors

1. Huayi Zhang (Worcester Polytechnic Institute)
2. Lei Cao (Massachusetts Institute of Technology)
3. Yizhou Yan (Worcester Polytechnic Institute)
4. Samuel Madden (Massachusetts Institute of Technology)
5. Elke A. Rundensteiner (Worcester Polytechnic Institute)

BibTeX Citation

@inproceedings{zhang_sigmod20,
        title = {{Continuously Adaptive Similarity Search}},
        author = {Zhang, Huayi and Cao, Lei and Yan, Yizhou and Madden, Samuel and Rundensteiner, Elke A.},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/mod0251},
        url = {https://dl.acm.org/doi/10.1145/mod0251},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
7,124	GTI: Graph-based Tree Index with Logarithm Updates for Nearest Neighbor Search in High-Dimensional Spaces	2025	VLDB	5.6961208e-05
10,400	Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search	2026	SIGMOD	5.093636e-05
10,447	Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph	2026	SIGMOD	5.093636e-05
11,573	DESIRE: An Efficient Dynamic Cluster-based Forest Indexing for Similarity Search in Multi-Metric Spaces	2022	VLDB	5.093636e-05
11,610	ONe Index for All Kernels (ONIAK): A Zero Re-Indexing LSH Solution to ANNS-ALT (After Linear Transformation)	2022	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
142	LOF: Identifying Density-Based Local Outliers	2000	SIGMOD	0.0002962566
287	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.00022323585
369	Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting	2012	SIGMOD	0.00019945234
693	Algorithms for Mining Distance-Based Outliers in Large Datasets	1998	VLDB	0.00014918477
907	A Framework for Clustering Evolving Data Streams	2003	VLDB	0.00013309819
1,198	Overview of Data Exploration Techniques	2015	SIGMOD	0.00011706307
3,389	Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond	2017	VLDB	7.4525222e-05
6,766	Sharing-Aware Outlier Analytics over High-Volume Data Streams	2016	SIGMOD	5.7802844e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,279	Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring	2020	SIGMOD
2	10,227	Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search	2026	SIGMOD
3	1,934	Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces	2023	VLDB
4	287	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB
5	332	Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search	2016	VLDB
6	2,390	Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing	2013	VLDB
7	6,583	Distance-Sensitive Hashing	2018	PODS
8	21	Similarity Search in High Dimensions via Hashing	1999	VLDB
9	2,673	DSH: Data Sensitive Hashing for High-Dimensional k-NN Search	2014	SIGMOD
10	5,666	Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search	2015	PODS