Database Paper Browser

Back to papers

GTI: Graph-based Tree Index with Logarithm Updates for Nearest Neighbor Search in High-Dimensional Spaces

Summary: GTI constructs a global tree with a lightweight graph at level‑1 to drastically cut graph construction cost and support logarithmic‑time insertions/deletions. Matches state‑of‑the‑art graph approximate search (and supports exact NNS) while yielding ≈10× update efficiency versus prior tree methods. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
14254
Venue
VLDB
Year
2025
Pagerank
4.6335219e-05
Overall Rank
7,843 | 45.50%
DOI
10.14778/3717755.3717760

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 28 of 28 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.0032118946
6 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0016113151
34 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00076824554
78 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.00056385781
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
331 The Query By Image Content (QBIC) System 1995 SIGMOD 0.00027199905
574 Distance-Based Indexing For High-Dimensional Metric Spaces 1997 SIGMOD 0.0001987713
763 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00016963981
1,013 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014632051
1,157 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00013600695
1,934 VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning 2020 VLDB 0.00010047294
2,002 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 9.8258191e-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,969 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7955562e-05
3,182 DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search 2020 VLDB 7.4280768e-05
3,403 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 7.1338786e-05
3,541 Similarity search in the blink of an eye with compressed indices 2023 VLDB 6.9910982e-05
3,544 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB 6.98759e-05
5,559 LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System 2022 VLDB 5.437026e-05
5,747 Hercules Against Data Series Similarity Search 2022 VLDB 5.3427166e-05
6,090 Reconciling Skyline and Ranking Queries 2017 VLDB 5.214198e-05
6,111 Continuously Adaptive Similarity Search 2020 SIGMOD 5.2016636e-05
6,378 Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings 2018 VLDB 5.0844506e-05
6,988 Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size 2021 SIGMOD 4.8665394e-05
7,654 LiteHST: A Tree Embedding based Method for Similarity Search 2023 SIGMOD 4.6831082e-05
8,167 GTS: GPU-based Tree Index for Fast Similarity Search 2024 SIGMOD 4.567569e-05
Previous Page 1 / 1 Next

Semantically Similar Papers