The Index Structure and Its Implementation Algorithm for the CQRtree Spatial Database
Peng Pan
Abstract
Peng Pan
Abstract
Spatial database index is the vital technique for improving the storage efficiency of spatial databases and the spatial retrieval performance.On the basis of the analysis of R tree,this paper puts forward a spatial database index structure CQRtree.This paper also presents the data structure of CQRtree, the insertion, deletion and searching algorithms for its implementation and the comparisons of the CQRtree with R tree. Finally the further research direction is given.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
Spatial database index is the vital technique for improving the storage efficiency of spatial databases and the spatial retrieval performance.On the basis of the analysis of R tree,this paper puts forward a spatial database index structure CQRtree.This paper also presents the data structure of CQRtree, the insertion, deletion and searching algorithms for its implementation and the comparisons of the CQRtree with R tree. Finally the further research direction is given.
Key concepts: Computer science, Spatial database, R-tree, Data mining, Index (typography), Database index, Database, Spatial analysis