iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search

Summary: iDEC introduces an indexable distance-estimating-code framework extending LSH for ANN. It achieves O(n) index space and ~O(log n) query time, beating LSH on Hamming/edit distances with scalable in-memory ANN-H and linking EEC, LSH, and iDEC. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: ha25e1479e17bc27c
Venue: VLDB
Year: 2020
Pagerank: 9.4092345e-05
Overall Rank: 1,897 | 87.25%
DOI: 10.14778/3397230.3397243

Incoming Non-self Citations Over Time

Authors

1. Long Gong (Georgia Institute of Technology)
2. Huayi Wang (Georgia Institute of Technology)
3. Mitsunori Ogihara (University of Miami)
4. Jun Xu (Georgia Institute of Technology)

BibTeX Citation

@article{gong_vldb20,
        title = {{iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search}},
        author = {Gong, Long and Wang, Huayi and Ogihara, Mitsunori and Xu, Jun},
        journal = {PVLDB},
        series = {{VLDB} '20},
        volume = {13},
        number = {9},
        pages = {1483--1497},
        doi = {10.14778/3397230.3397243},
        url = {https://doi.org/10.14778/3397230.3397243},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
194	Milvus: A Purpose-Built Vector Data Management System	2021	SIGMOD	0.00025636725
345	A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search	2021	VLDB	0.00020445545
804	RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search	2024	SIGMOD	0.00013832333
1,225	ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data	2024	SIGMOD	0.00011444398
1,462	Manu: A Cloud Native Vector Database Management System	2022	VLDB	0.0001058099
1,613	Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment	2024	SIGMOD	0.00010072237
6,609	Dumpy: A Compact and Adaptive Index for Large Data Series Collections	2023	SIGMOD	5.7354155e-05
6,919	GTI: Graph-based Tree Index with Logarithm Updates for Nearest Neighbor Search in High-Dimensional Spaces	2025	VLDB	5.644237e-05
7,593	DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph	2025	SIGMOD	5.4880197e-05
8,259	Attribute Filtering in Approximate Nearest Neighbor Search: An In-depth Experimental Study	2026	SIGMOD	5.3665309e-05
8,775	Bidirectionally Densifying LSH Sketches with Empty Bins	2021	SIGMOD	5.2800974e-05
9,560	Distribution-Aware Exploration for Adaptive HNSW Search	2026	SIGMOD	5.1571823e-05
10,324	TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning	2026	SIGMOD	5.0346745e-05
10,726	I/O Optimizations for Graph-Based Disk-Resident Approximate Nearest Neighbor Search: A Design Space Exploration	2026	VLDB	4.9793485e-05
12,035	MP-RW-LSH: An Efficient Multi-Probe LSH Solution to ANNS-L1	2021	VLDB	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.001992968
74	Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph	2019	VLDB	0.00037091678
280	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.0002230467
298	Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search	2016	VLDB	0.00021833987
338	Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting	2012	SIGMOD	0.00020585187
562	SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index	2015	VLDB	0.00016335405
650	HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces	2018	VLDB	0.00015149775
927	SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search	2014	VLDB	0.00013025904
1,933	Pass-Join: A Partition-based Method for Similarity Joins	2012	VLDB	9.3459285e-05
2,568	Locality-Sensitive Hashing for Earthquake Detection: A Case Study of Scaling Data-Driven Science	2018	VLDB	8.2870435e-05
2,730	Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search	2020	VLDB	8.0861221e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,054	On the I/O Complexity of the k-Nearest Neighbors Problem	2020	PODS
2	20	Similarity Search in High Dimensions via Hashing	1999	VLDB
3	2,969	Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring	2020	SIGMOD
4	576	Quality and Efficiency in High Dimensional Nearest Neighbor Search	2009	SIGMOD
5	927	SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search	2014	VLDB
6	1,485	PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search	2020	VLDB
7	3,546	A General and Efficient Querying Method for Learning to Hash	2018	SIGMOD
8	6,239	Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search	2025	VLDB
9	1,625	Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces	2023	VLDB
10	5,527	DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search	2024	VLDB