Spatial Index Method Based on R-tree
Xiaojun Tan
Abstract
Xiaojun Tan
Abstract
To further enhance the R-tree spatial index data retrieval performance,a MRD-tree index is presented based on R-tree,which contains both external approximate shape and internal approximate shape of spatial object,and it is allowed that the data entry stores in middle nodes.The number of I/O and the cost time of CPU are reduced during the search by the index,and a series of tests indicate that the MRD-tree index improves the query efficiency of spatial data.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
To further enhance the R-tree spatial index data retrieval performance,a MRD-tree index is presented based on R-tree,which contains both external approximate shape and internal approximate shape of spatial object,and it is allowed that the data entry stores in middle nodes.The number of I/O and the cost time of CPU are reduced during the search by the index,and a series of tests indicate that the MRD-tree index improves the query efficiency of spatial data.
Key concepts: R-tree, Computer science, Index (typography), Tree (set theory), Spatial database, Spatial analysis, Object (grammar), Data mining