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: 5815
Venue: SIGMOD
Year: 2020
Pagerank: 5.2016636e-05
Overall Rank: 6,111 | 57.53%
DOI: 10.1145/mod0251

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
7,843	GTI: Graph-based Tree Index with Logarithm Updates for Nearest Neighbor Search in High-Dimensional Spaces	2025	VLDB	4.6335219e-05
10,111	Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search	2026	SIGMOD	4.1905499e-05
10,158	Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph	2026	SIGMOD	4.1905499e-05
11,377	DESIRE: An Efficient Dynamic Cluster-based Forest Indexing for Similarity Search in Multi-Metric Spaces	2022	VLDB	4.1905499e-05
11,415	ONe Index for All Kernels (ONIAK): A Zero Re-Indexing LSH Solution to ANNS-ALT (After Linear Transformation)	2022	VLDB	4.1905499e-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
159	LOF: Identifying Density-Based Local Outliers	2000	SIGMOD	0.00040135453
399	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.00024359304
579	Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting	2012	SIGMOD	0.0001982328
663	A Framework for Clustering Evolving Data Streams	2003	VLDB	0.00018466049
768	Algorithms for Mining Distance-Based Outliers in Large Datasets	1998	VLDB	0.00016864875
1,507	Overview of Data Exploration Techniques	2015	SIGMOD	0.00011594294
3,933	Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond	2017	VLDB	6.6164676e-05
6,990	Sharing-Aware Outlier Analytics over High-Volume Data Streams	2016	SIGMOD	4.8656085e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,500	OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences	2003	VLDB	8.6388583e-05
1,966	LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index	2016	SIGMOD	9.9130791e-05
4,230	Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring	2020	SIGMOD	6.3337893e-05
2,969	Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces	2023	VLDB	7.7955562e-05
399	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.00024359304
596	Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search	2016	VLDB	0.00019455943
2,872	Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing	2013	VLDB	7.9797548e-05
34	Similarity Search in High Dimensions via Hashing	1999	VLDB	0.00076824554
3,019	DSH: Data Sensitive Hashing for High-Dimensional k-NN Search	2014	SIGMOD	7.699097e-05
8,759	Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search	2015	PODS	4.4520434e-05