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: 5814
Venue: SIGMOD
Year: 2020
Pagerank: 5.2066612e-05
Overall Rank: 6,107 | 57.52%
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,837	GTI: Graph-based Tree Index with Logarithm Updates for Nearest Neighbor Search in High-Dimensional Spaces	2025	VLDB	4.6379694e-05
10,111	Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search	2026	SIGMOD	4.1945683e-05
10,158	Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph	2026	SIGMOD	4.1945683e-05
11,375	DESIRE: An Efficient Dynamic Cluster-based Forest Indexing for Similarity Search in Multi-Metric Spaces	2022	VLDB	4.1945683e-05
11,412	ONe Index for All Kernels (ONIAK): A Zero Re-Indexing LSH Solution to ANNS-ALT (After Linear Transformation)	2022	VLDB	4.1945683e-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
161	LOF: Identifying Density-Based Local Outliers	2000	SIGMOD	0.00039846974
400	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.0002427237
605	Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting	2012	SIGMOD	0.000193396
662	A Framework for Clustering Evolving Data Streams	2003	VLDB	0.00018475968
774	Algorithms for Mining Distance-Based Outliers in Large Datasets	1998	VLDB	0.00016865771
1,552	Overview of Data Exploration Techniques	2015	SIGMOD	0.00011408814
3,938	Intelligent Probing for Locality Sensitive Hashing: Multi-Probe LSH and Beyond	2017	VLDB	6.6155909e-05
6,991	Sharing-Aware Outlier Analytics over High-Volume Data Streams	2016	SIGMOD	4.8702811e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,497	OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences	2003	VLDB	8.6472036e-05
1,971	LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index	2016	SIGMOD	9.893198e-05
4,243	Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring	2020	SIGMOD	6.32976e-05
2,971	Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces	2023	VLDB	7.7970531e-05
400	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.0002427237
562	Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search	2016	VLDB	0.00020091752
2,870	Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing	2013	VLDB	7.9799783e-05
34	Similarity Search in High Dimensions via Hashing	1999	VLDB	0.00076637636
3,056	DSH: Data Sensitive Hashing for High-Dimensional k-NN Search	2014	SIGMOD	7.6432146e-05
8,763	Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search	2015	PODS	4.456315e-05