Fast Algorithm for Anchor Graph Hashing

Summary: Tridiagonal hashing speeds anchor-graph hashing by deriving eigenvectors from a tridiagonal matrix of anchor–data similarities using clustering. Query-time anchor proximity uses dimensionality reduction, yielding faster search and improved accuracy. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 12606
Venue: VLDB
Year: 2021
Pagerank: 4.1945683e-05
Overall Rank: 11,541 | 19.72%
DOI: 10.14778/3447689.3447696

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 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.0032169493
34	Similarity Search in High Dimensions via Hashing	1999	VLDB	0.00076637636
79	A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces	1998	VLDB	0.00056242144
284	The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries	1997	SIGMOD	0.00028994728
562	Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search	2016	VLDB	0.00020091752
605	Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting	2012	SIGMOD	0.000193396
682	Quality and Efficiency in High Dimensional Nearest Neighbor Search	2009	SIGMOD	0.00018201541
709	Efficient Similarity Search and Classification via Rank Aggregation	2003	SIGMOD	0.00017768547
867	SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index	2015	VLDB	0.00015792021
1,757	VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning	2020	VLDB	0.00010660932
11,955	Scaling Manifold Ranking Based Image Retrieval	2015	VLDB	4.1945683e-05
13,337	Fast Algorithm for the Lasso based L1-Graph Construction	2017	VLDB	-

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
212	Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph	2019	VLDB	0.00033913475
9,552	Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs	2025	SIGMOD	4.3254416e-05
110	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB	0.00047892924
10,073	Efficient Approximate Nearest Neighbor Search via Hemi-Sphere Centroids Graph	2026	SIGMOD	4.1945683e-05
3,056	DSH: Data Sensitive Hashing for High-Dimensional k-NN Search	2014	SIGMOD	7.6432146e-05
6,399	Similarity Search and Locality Sensitive Hashing using Ternary Content Addressable Memories	2010	SIGMOD	5.0818596e-05
4,609	A General and Efficient Querying Method for Learning to Hash	2018	SIGMOD	6.0528541e-05
7,301	Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search	2018	SIGMOD	4.768971e-05
5,224	Neighbor-Sensitive Hashing	2016	VLDB	5.6197981e-05
34	Similarity Search in High Dimensions via Hashing	1999	VLDB	0.00076637636