Advertisement
Published in:
2011 | OriginalPaper | Chapter
Study of Spatial Data Index Structure Based on Hybrid Tree
Authors : Yonghui Wang, Yunlong Zhu, Huanliang Sun
Published in: Knowledge Engineering and Management
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In order to improve the efficiency of spatial data access and retrieval performance, an index structure is designed, it solves the problem of low query efficiency of the single index structure when there are large amount of data. Through the establishment of correspondence between the logical records and physical records of the spatial data, the hybrid spatial data index structure is designed based on 2
K
–tree and R-tree. The insertion, deletion and query algorithm are implemented based on the hybrid tree, and the accuracy and efficiency are verified. The experimental results show that the hybrid tree needs more storage space then R-tree, but with the data volume increasing the storage space needed declining relatively, and the hybrid tree is better than the R-tree in the retrieval efficiency, and with the data volume increasing the advantage is more obvious.