The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
Summary: A-tree introduces Virtual Bounding Rectangles (VBRs) to compactly approximate MBRs and data for high-dimensional similarity search. High fanout with MBR–VBR entries yields fast search and pruning; on real data up to 64D it saves ~77% page accesses vs SR-tree and ~78% vs VA-File. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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 |
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 34 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB | 0.00076637636 |
| 47 | Nearest Neighbor Queries | 1995 | SIGMOD | 0.0007015885 |
| 79 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | 1998 | VLDB | 0.00056242144 |
| 129 | The X-tree: An Index Structure for High-Dimensional Data | 1996 | VLDB | 0.0004429571 |
| 284 | The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries | 1997 | SIGMOD | 0.00028994728 |
| 354 | Hilbert R-tree: An Improved R-tree Using Fractals | 1994 | VLDB | 0.00026137988 |
| 1,183 | A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space | 1997 | PODS | 0.00013455596 |
| 1,945 | Multidimensional Access Methods: Trees Have Grown Everywhere | 1997 | VLDB | 0.00010001003 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,294 | Worst-Case Efficient Range Search Indexing | 2009 | PODS | 4.1945683e-05 |
| 34 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB | 0.00076637636 |
| 91 | M-tree: An Efficient Access Method for Similarity Search in Metric Spaces | 1997 | VLDB | 0.0005181666 |
| 575 | Distance-Based Indexing For High-Dimensional Metric Spaces | 1997 | SIGMOD | 0.00019882723 |
| 682 | Quality and Efficiency in High Dimensional Nearest Neighbor Search | 2009 | SIGMOD | 0.00018201541 |
| 8,647 | A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases | 2006 | SIGMOD | 4.4768766e-05 |
| 79 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | 1998 | VLDB | 0.00056242144 |
| 9,767 | Adaptive Indexing of Objects with Spatial Extent | 2023 | VLDB | 4.2856106e-05 |
| 284 | The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries | 1997 | SIGMOD | 0.00028994728 |
| 9,283 | Adaptive Indexing in High-Dimensional Metric Spaces | 2023 | VLDB | 4.3631652e-05 |