2004 · 22 citations · 8 references
ComputingComputer ScienceData ManagementData StructuresDatabasesData Storage SystemsData Structure AlgorithmsDatabase ManagementHash TablesNearest Neighbor SearchQuery ProcessingB-tree IndexingB-treesIndex StructuresIndexing StructuresK-d TreesKd-treesMultidimensional IndexingScalable Indexing
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.
8
Multidimensional binary search trees used for associative searching
Jon Bentley · Communications of the ACM · 1975 · 7.5K citations · Full text
John T. Robinson · 1981 · 888 citations · Full text
Stefan Berchtold, Christian Böhm, Hans-Peter Kriegal · 1998 · 402 citations · Full text
John T. Robinson · 1981 · 212 citations