Premium
Algorithms for BD trees
Author(s) -
Dandamudi Sivarama P.,
Sorenson Paul G.
Publication year - 1986
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380161203
Subject(s) - computer science , data structure , tree (set theory) , class (philosophy) , tree structure , theoretical computer science , range (aeronautics) , data mining , algorithm , database , mathematics , artificial intelligence , programming language , combinatorics , materials science , composite material
Database applications often require a sophisticated class of storage structures in order to answer different types of queries efficiently. This often dictates that the file should be organized on multiple keys. Several storage structures have been proposed to satisfy these needs. Most are generalizations of the storage structures used for managing one‐dimensional data. Recently, a new storage structure, called the BD tree, was proposed to manage multidimensional data. This structure has good dynamic characteristics. This paper presents algorithms for the BD tree to perform insertion, deletion, and to answer exact match, partial match and range queries. In addition, some experimental evidence is presented that suggests that BD trees have good dynamic characteristics.