Spatial indexing of high-dimensional data based on relative approximation

• Published in: The VLDB journal 2002-10, Vol.11 (2), p.93-108
• Main Authors: SAKURAI, Yasushi, YOSHIKAWA, Masatoshi, UEMURA, Shunsuke, KOJIMA, Haruhiko
• Format: Article
• Language: English
• Subjects: Applied sciences; Computer science; control theory; systems; Exact sciences and technology; Information systems. Data bases; Memory organisation. Data processing; Software
• ISSN: 1066-8888; 0949-877X
• DOI: 10.1007/s00778-002-0066-9

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 importantly, we have a free hand in arranging MBRs and VBRs in the tree nodes. Each A-tree node contains an MBR and its children VBRs. Therefore, by fetching an A-tree node, we can obtain information on the exact position of a parent MBR and the approximate position of its children. We have performed experiments using both synthetic and real data sets. For the real data sets, the A-tree outperforms the SR-tree and the VA-file in all dimensionalities up to 64 dimensions, which is the highest dimension in our experiments. Additionally, we propose a cost model for the A-tree. We verify the validity of the cost model for synthetic and real data sets.