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
- 7435
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,124 | 29.64%
- DOI
-
10.1145/3769838
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
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.00051785122 |
| 210 |
Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph |
2019 |
VLDB |
0.00034086264 |
| 494 |
Milvus: A Purpose-Built Vector Data Management System |
2021 |
SIGMOD |
0.00021769407 |
| 596 |
Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search |
2016 |
VLDB |
0.00019455943 |
| 730 |
AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data |
2020 |
VLDB |
0.00017443615 |
| 858 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00015833075 |
| 1,252 |
Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan |
2016 |
VLDB |
0.00013023834 |
| 1,347 |
Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination |
2020 |
SIGMOD |
0.00012463441 |
| 1,927 |
Efficient Processing of k Nearest Neighbor Joins using MapReduce |
2012 |
VLDB |
0.00010062395 |
| 2,002 |
Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases |
2023 |
SIGMOD |
9.8258191e-05 |
| 2,287 |
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search |
2024 |
SIGMOD |
9.1004806e-05 |
| 2,434 |
iDEC: Indexable Distance Estimating Codes for Approximate Nearest Neighbor Search |
2020 |
VLDB |
8.8225986e-05 |
| 2,687 |
HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search |
2022 |
VLDB |
8.3079951e-05 |
| 2,692 |
Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment |
2024 |
SIGMOD |
8.2857267e-05 |
| 2,772 |
High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations |
2023 |
SIGMOD |
8.1491893e-05 |
| 2,969 |
Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces |
2023 |
VLDB |
7.7955562e-05 |
| 3,541 |
Similarity search in the blink of an eye with compressed indices |
2023 |
VLDB |
6.9910982e-05 |
| 3,552 |
SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search |
2024 |
SIGMOD |
6.9765275e-05 |
| 4,598 |
A General and Efficient Querying Method for Learning to Hash |
2018 |
SIGMOD |
6.053944e-05 |
| 4,600 |
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search |
2025 |
SIGMOD |
6.0528015e-05 |
| 7,235 |
Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search |
2025 |
VLDB |
4.7882389e-05 |
| 7,608 |
Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities |
2025 |
SIGMOD |
4.6922063e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 8,484 |
Maximum Inner Product is Query-Scaled Nearest Neighbor |
2025 |
VLDB |
4.4956257e-05 |
| 1,013 |
HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces |
2018 |
VLDB |
0.00014632051 |
| 3,541 |
Similarity search in the blink of an eye with compressed indices |
2023 |
VLDB |
6.9910982e-05 |
| 4,193 |
New Trends in High-D Vector Similarity Search: AI-driven, Progressive, and Distributed |
2021 |
VLDB |
6.3657766e-05 |
| 4,600 |
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search |
2025 |
SIGMOD |
6.0528015e-05 |
| 8,645 |
A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases |
2006 |
SIGMOD |
4.4725847e-05 |
| 78 |
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces |
1998 |
VLDB |
0.00056385781 |
| 13,104 |
TRIM: An Efficient Framework for Exact Eccentricity Computation on Large-Scale Graphs |
2026 |
VLDB |
- |
| 10,042 |
Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations |
2026 |
SIGMOD |
4.1905499e-05 |
| 7,608 |
Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities |
2025 |
SIGMOD |
4.6922063e-05 |