Spatial indexing of high-dimensional data based on relative approximation

@article{Sakurai2002SpatialIO,
  title={Spatial indexing of high-dimensional data based on relative approximation},
  author={Yasushi Sakurai and Masatoshi Yoshikawa and Shunsuke Uemura and Haruhiko Kojima},
  journal={The VLDB Journal},
  year={2002},
  volume={11},
  pages={93-108}
}
We propose a novel index structure, the A-tree (approximation tree), for similarity searches in high-dimensional data. The basic idea of the A-tree is the introduction of virtual bounding rectangles (VBRs) which contain and approximate MBRs or data objects. VBRs can be represented quite compactly and thus affect the tree configuration both quantitatively and qualitatively. First, since tree nodes can contain a large number of VBR entries, fanout becomes large, which increases search speed. More… CONTINUE READING