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
- 1. Yasushi Sakurai (Nippon Telegraph and Telephone Cyber Solutions Laboratories)
- 2. Masatoshi Yoshikawa (Nara Institute of Science and Technology)
- 3. Shunsuke Uemura (Nara Institute of Science and Technology)
- 4. Haruhiko Kojima (Nippon Telegraph and Telephone Cyber Solutions Laboratories)
BibTeX Citation
@article{sakurai_vldb00,
title = {{The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation}},
author = {Sakurai, Yasushi and Yoshikawa, Masatoshi and Uemura, Shunsuke and Kojima, Haruhiko},
journal = {PVLDB},
series = {{VLDB} '00},
pages = {516},
year = {2000}
}
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.0020210012 |
| 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.001157935 |
| 21 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB | 0.00056760516 |
| 28 | Nearest Neighbor Queries | 1995 | SIGMOD | 0.00052102434 |
| 46 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | 1998 | VLDB | 0.00044853085 |
| 85 | The X-tree: An Index Structure for High-Dimensional Data | 1996 | VLDB | 0.00035405879 |
| 277 | The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries | 1997 | SIGMOD | 0.00022537944 |
| 329 | Hilbert R-tree: An Improved R-tree Using Fractals | 1994 | VLDB | 0.00021068647 |
| 1,137 | A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space | 1997 | PODS | 0.00012027131 |
| 2,421 | Multidimensional Access Methods: Trees Have Grown Everywhere | 1997 | VLDB | 8.6033032e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,489 | Worst-Case Efficient Range Search Indexing | 2009 | PODS |
| 2 | 21 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB |
| 3 | 56 | M-tree: An Efficient Access Method for Similarity Search in Metric Spaces | 1997 | VLDB |
| 4 | 592 | Distance-Based Indexing For High-Dimensional Metric Spaces | 1997 | SIGMOD |
| 5 | 581 | Quality and Efficiency in High Dimensional Nearest Neighbor Search | 2009 | SIGMOD |
| 6 | 8,655 | A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases | 2006 | SIGMOD |
| 7 | 46 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | 1998 | VLDB |
| 8 | 9,887 | Adaptive Indexing of Objects with Spatial Extent | 2023 | VLDB |
| 9 | 277 | The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries | 1997 | SIGMOD |
| 10 | 9,334 | Adaptive Indexing in High-Dimensional Metric Spaces | 2023 | VLDB |