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.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 |
| 48 | Nearest Neighbor Queries | 1995 | SIGMOD | 0.0006954126 |
| 78 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | 1998 | VLDB | 0.00056385781 |
| 129 | The X-tree: An Index Structure for High-Dimensional Data | 1996 | VLDB | 0.00044255276 |
| 301 | The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries | 1997 | SIGMOD | 0.00028396714 |
| 356 | Hilbert R-tree: An Improved R-tree Using Fractals | 1994 | VLDB | 0.00026091196 |
| 1,180 | A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space | 1997 | PODS | 0.00013455619 |
| 1,943 | Multidimensional Access Methods: Trees Have Grown Everywhere | 1997 | VLDB | 0.00010009557 |
Previous
Page 1 / 1
Next