KDB/sub KD/-tree: a compact KDB-tree structure for indexing multidimensional data

The problem of storing and retrieving high-dimensional data continues to be an important issue. In this paper, we propose an efficient high-dimensional point access method called the KDB/sub KD/-tree. The KDBKD-tree eliminates redundant information in KDB-trees by changing the representation of the index entries in the interior pages. Experimental evidence shows that the KDB/sub KD/-tree outperforms other recent variants of KDB-trees, such as KDB/sub FD/-trees and KDB/sub HD/-trees.