CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

authors Robinson, John T.
year 1981
title The K-D-B-Tree : A Search Structure of Large Multidimensional Dynamic Indexes
source 22 p. : ill
summary Pittsburgh, PA: Department of Computer Science, CMU, February, 1981. CMU-CS-81-106. includes some bibliographical references. The problem of retrieving multikey records via range queries form a large, dynamic index is considered. By large it is meant that most of the index must be sorted on secondary memory. By dynamic it is meant that insertions and deletions are intermixed with queries, so that the index cannot be built beforehand. A new data structure, the K-D-B-tree, is presented as a solution to this problem. K-D-B-trees combine properties of K-D-trees and B-trees. It is expected that the multidimensional search efficiency of balanced K-D-trees and the I/O efficiency of B-trees should both be approximated in the K-D-B-tree. Preliminary experimental results that tend to support this are reported
keywords algorithms, search
series CADline
references Content-type: text/plain
last changed 2003/06/02 11:58
HOMELOGIN (you are user _anon_622608 from group guest) Works Powered by SciX Open Publishing Services 1.002