An Integration Algorithm of X-tree and kd-tree for Efficient Retrieval of Spatial Database

In spatial database based on spatial data structures, instead of one-dimensional indexing structure, new indexing structure which corresponds to multi-dimensional features of spatial objects is required. In order to meet those requirements, in this paper we proposed new indexing structure for efficient retrieval of spatial database by carrying through the feature analysis of conventional multi-dimensional indexing structures. To improve the sequential search method of supernodes in the conventional X-tree and to reduce the retrieval time in case of generating the huge supernode, we proposed a indexing structure integrating the kd-tree based on point index structure into the X-tree. We implemented the proposed indexing structure and analyzed its retrieval time according to the dimension and distribution of experimental data.