Title :
A new tree type data structure with homogeneous nodes suitable for a very large spatial database
Author :
Ohsawa, Yutaka ; Sakauchi, Masao
Author_Institution :
Inst. of Ind. Sci., Tokyo Univ., Japan
Abstract :
A new dynamic data structure for spatial retrieval called a GBD tree is proposed. The GBD tree is systematically constructed using homogeneous nodes with a small amount of extra data called a DZ expression which plays an important role in efficient multiway recursive division of N-dimensional space. On the GBD tree, CPU cost during insertion and deletion is much smaller than on an R-tree, while attaining higher spatial retrieval efficiency
Keywords :
computer graphics; data structures; database management systems; information retrieval systems; trees (mathematics); CPU cost; DZ expression; GBD tree; N-dimensional space; R-tree; deletion; dynamic data structure; efficient multiway recursive division; homogeneous nodes; insertion; retrieval efficiency; spatial retrieval; tree type data structure; very large spatial database; Binary trees; Computer industry; Costs; Data handling; Data structures; Information retrieval; Pattern recognition; Spatial databases; Tree data structures; Tree graphs;
Conference_Titel :
Data Engineering, 1990. Proceedings. Sixth International Conference on
Conference_Location :
Los Angeles, CA
Print_ISBN :
0-8186-2025-0
DOI :
10.1109/ICDE.1990.113481
