Query efficiency of geographic information system is a critical factor which depends on the query algorithm, and query algorithm is dependent on indexing structure. Based on the R-Tree spatial index, a method optimizing the query index is proposed for GIS most adjacent query and multi-dimensional data structure is designed. Query performance of the structure is analyzed theoretically and advantages are proved. The spatial overlap is effectively reduced and the query efficiency is improved. Application results show that the method can meet the application requirements with low-speed operating environment, and has a certain predictability constraints for query time.
[1]
Antonin Guttman,et al.
R-trees: a dynamic index structure for spatial searching
,
1984,
SIGMOD '84.
[2]
Yan Yu,et al.
Reverse NN Search Based on MR-Tree for Polygon Dataset
,
2009,
2009 First International Conference on Information Science and Engineering.
[3]
Gao Xiao-shuang.
Spatial Index Structure Based on R-tree
,
2009
.
[4]
A. Guttman,et al.
A Dynamic Index Structure for Spatial Searching
,
1984,
SIGMOD 1984.
[5]
Zhang Zuo,et al.
QR-tree:a Kind of Spatial Index Structure Based on R-tree and Quad-tree
,
2004
.