DBScholar

Back to papers

TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search

Summary: TaCo makes subspace collision data-adaptive via entropy-balanced transformations and query-aware through dynamically allocated probing. It delivers up to 8× faster indexing, 0.6× memory use, and 1.5× higher query throughput. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
h170314f1d20b9c63
Venue
SIGMOD
Year
2026
Pagerank
4.9769913e-05
Overall Rank
10,520 | 29.30%
DOI
10.1145/3802118
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{wei_sigmod26,
        title = {{TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search}},
        author = {Wei, Jiuqi and Liao, Zhenyu and Han, Ruoyu and Xu, Quanqing and Yang, Chuanhui and Palpanas, Themis},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802118},
        url = {https://dl.acm.org/doi/10.1145/3802118},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 33 of 33 cited papers.

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

Rank Cited Paper Year Venue Pagerank
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037145866
189 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.0002585319
339 AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data 2020 VLDB 0.00020561716
344 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00020455839
803 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00013838349
1,225 ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data 2024 SIGMOD 0.00011447937
1,373 High-Throughput Vector Similarity Search in Knowledge Graphs 2023 SIGMOD 0.00010891169
1,481 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010535847
1,603 Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment 2024 SIGMOD 0.00010100279
1,618 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.00010053127
1,958 SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search 2024 SIGMOD 9.3118048e-05
2,114 What is the nearest neighbor in high dimensional spaces? 2000 VLDB 9.0164212e-05
2,264 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.7286407e-05
2,717 iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search 2024 SIGMOD 8.0953706e-05
2,730 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.0842027e-05
2,783 Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search 2024 SIGMOD 8.0204877e-05
2,813 OceanBase: A 707 Million tpmC Distributed Relational Database System 2022 VLDB 7.9773891e-05
2,821 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 7.9674226e-05
2,870 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 7.919641e-05
2,872 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 7.9191725e-05
2,955 Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring 2020 SIGMOD 7.8111585e-05
3,378 SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search 2025 SIGMOD 7.3542798e-05
4,500 PQCache: Product Quantization-based KVCache for Long Context LLM Inference 2025 SIGMOD 6.573164e-05
4,600 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 6.5055567e-05
4,685 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.4692031e-05
4,690 Learned Cardinality Estimation for Similarity Queries 2021 SIGMOD 6.4667478e-05
5,886 MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search 2025 SIGMOD 5.955484e-05
6,612 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.732933e-05
7,267 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.5677188e-05
9,146 DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search 2026 SIGMOD 5.2199557e-05
9,535 SAQ: Pushing the Limits of Vector Quantization through Code Adjustment and Dimension Segmentation 2026 SIGMOD 5.1636285e-05
9,571 LeaFi: Data Series Indexes on Steroids with Learned Filters 2025 SIGMOD 5.154741e-05
10,083 Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts 2025 VLDB 5.0806786e-05
Previous Page 1 / 1 Next

Semantically Similar Papers