(data structure)
Definition: A generalized BD-tree, hence the name, which stores spatially extended objects as a hierarchy of minimum bounding boxes. It is a balanced multiway tree which serves as a spatial access method.
Generalization (I am a kind of ...)
spatial access method.
Note: After [GG98, page 211].
Author: PEB
Yutaka Ohsawa and Masao Sakauchi, A New Tree Type Data Structure with Homogeneous Nodes Suitable for a Very Large Spatial Database, Proc. Sixth International Conference on Data Engineering, February 5-9, 1990, Los Angeles, California, USA, pages 296-303.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 14 May 2007.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "GBD-tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 14 May 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/gbdtree.html
