Abstract: Spatial indexing techniques can efficiently improve the storage and query efficiency.IN the large spatial database of GIS,the traditional spatial indexing structures,the R-tree has the problem that with the growing dimensionality and data number,the searching function will decrease greatly.On the basis of the analysis of R-tree,this paper puts forward a new spatial indexing structure for GIS with very large spatial database-the QR-tree.