A new tree type data structure with homogeneous nodes suitable for a very large spatial database

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.<
>