Database Paper Browser

Back to papers

TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning

Summary: TRIM enhances triangle‑inequality lower‑bound pruning for high‑dimensional vector search via optimized landmark selection and tunable bound relaxation to combat distance concentration. Pluggable into graph/quantization/disk indexes (HNSW, IVFPQ, DiskANN), yields massive reductions in distance/I/O (up to 99% pruning, 90–200% speedups, up to 58% I/O cut) while maintaining accuracy. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
7434
Venue
SIGMOD
Year
2026
Pagerank
4.1945683e-05
Overall Rank
10,124 | 29.57%
DOI
10.1145/3769838

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
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 22 of 22 cited papers.

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

Rank Cited Paper Year Venue Pagerank
91 M-tree: An Efficient Access Method for Similarity Search in Metric Spaces 1997 VLDB 0.0005181666
212 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00033913475
495 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00021767688
562 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00020091752
736 AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data 2020 VLDB 0.00017447617
867 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00015792021
1,269 Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan 2016 VLDB 0.00012930432
1,364 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00012370117
1,931 Efficient Processing of k Nearest Neighbor Joins using MapReduce 2012 VLDB 0.00010040427
2,023 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 9.7544991e-05
2,324 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 9.0326444e-05
2,435 iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search 2020 VLDB 8.8252237e-05
2,690 Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment 2024 SIGMOD 8.293714e-05
2,725 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 8.2294908e-05
2,811 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 8.0806307e-05
2,971 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7970531e-05
3,609 Similarity search in the blink of an eye with compressed indices 2023 VLDB 6.9215236e-05
3,624 SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search 2024 SIGMOD 6.9056e-05
4,598 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 6.0586236e-05
4,609 A General and Efficient Querying Method for Learning to Hash 2018 SIGMOD 6.0528541e-05
7,239 Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search 2025 VLDB 4.792836e-05
7,606 Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities 2025 SIGMOD 4.6967106e-05
Previous Page 1 / 1 Next

Semantically Similar Papers