A General and Efficient Querying Method for Learning to Hash

Summary: Introduces quantization distance (QD), a fine-grained similarity indicator to replace Hamming distance in learning-to-hash for ANN. Proposes two efficient QD-based querying methods that surpass Hamming ranking and generalize across L2H algorithms, delivering noticeable gains with a simpler design. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 5532
Venue: SIGMOD
Year: 2018
Pagerank: 7.067591e-05
Overall Rank: 3,858 | 73.54%
DOI: 10.1145/3183713.3183750

Incoming Non-self Citations Over Time

Authors

1. Jinfeng Li (Chinese University of Hong Kong)
2. Xiao Yan (Chinese University of Hong Kong)
3. Jian Zhang (Chinese University of Hong Kong)
4. An Xu (Chinese University of Hong Kong)
5. James Cheng (Chinese University of Hong Kong)
6. Jie Liu (Chinese University of Hong Kong)
7. Kelvin K. W. Ng (Chinese University of Hong Kong)
8. Ti-chung Cheng (Chinese University of Hong Kong)

BibTeX Citation

@inproceedings{li_sigmod18,
        title = {{A General and Efficient Querying Method for Learning to Hash}},
        author = {Li, Jinfeng and Yan, Xiao and Zhang, Jian and Xu, An and Cheng, James and Liu, Jie and Ng, Kelvin K. W. and Cheng, Ti-chung},
        series = {{SIGMOD} '18},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3183713.3183750},
        url = {https://dl.acm.org/doi/10.1145/3183713.3183750},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,357	RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search	2024	SIGMOD	0.00011043994
1,546	PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search	2020	VLDB	0.00010407159
1,735	High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations	2023	SIGMOD	9.9004924e-05
5,223	FARGO: Fast Maximum Inner Product Search via Global Multi-Probing	2023	VLDB	6.3102417e-05
6,851	Maximum Inner Product is Query-Scaled Nearest Neighbor	2025	VLDB	5.7546877e-05
7,761	DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph	2025	SIGMOD	5.550467e-05
8,169	NaviX: A Native Vector Index Design for Graph DBMSs With Robust Predicate-Agnostic Search Performance	2025	VLDB	5.4742745e-05
10,412	TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning	2026	SIGMOD	5.093636e-05
10,490	RAIRS: Optimizing Redundant Assignment and List Layout for IVF-Based ANN Search	2026	SIGMOD	5.093636e-05
10,525	Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search	2026	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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.0020210012
287	Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search	2007	VLDB	0.00022323585
332	Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search	2016	VLDB	0.00020920444
369	Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting	2012	SIGMOD	0.00019945234
581	Quality and Efficiency in High Dimensional Nearest Neighbor Search	2009	SIGMOD	0.00016153395
990	SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search	2014	VLDB	0.00012796562
1,572	LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index	2016	SIGMOD	0.00010329197
3,789	Husky: Towards a More Efficient and Expressive Distributed Computing Framework	2016	VLDB	7.1240627e-05
8,270	LFTF: A Framework for Efficient Tensor Analytics at Scale	2017	VLDB	5.4574671e-05
11,987	The Best of Both Worlds: Big Data Programming with Both Productivity and Performance	2017	SIGMOD	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	369	Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting	2012	SIGMOD
2	1,546	PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search	2020	VLDB
3	7,942	Efficient and Tunable Similar Set Retrieval	2001	SIGMOD
4	1,934	Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces	2023	VLDB
5	5,666	Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search	2015	PODS
6	21	Similarity Search in High Dimensions via Hashing	1999	VLDB
7	5,800	DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search	2024	VLDB
8	4,927	Neighbor-Sensitive Hashing	2016	VLDB
9	9,493	MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances	2023	VLDB
10	332	Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search	2016	VLDB