7Guttman &R-Tree a dynamic index structure for spatial searching[C]// Proceedings of ACM SIGMOD, Boston,MA, 1984:47-57.
8Beckmann N,Kriegel H P, Schneider R,et al.The R^*-tree :an efficient and robust access method for points and rectangles[C]//Proc AC3,1 SIGMOD International Conference on Management of Data, 1990: 322-332.
9Guttman A. R-trees: A Dynamic Index Structures for Spatial Searching[ M]. Proc. ACM SIGMOD, 1984:47 - 57.
10S T Leuteegger, M A Lopez, J M Edgington. S TR: A Simple and Efficient Algorithm for R-Tree Packing[ M]. In: Proceedings of the International Conference on Data Engineering, 1997.
3Finkel R A , Bentley J L. Quad Trees a Data Struc- ture for Retrieval on Composite Keys[J], Acta In- formatica ,1974,4(1) : 1-9.
4Guttman A. R-trees: A Dynamic Index Structure for Spatial Searching[J]. ACM, 1984,14(2) :47-57.
5Sellis T, Roussopoulos N, Faloutsos C. The R+- tree: A Dynamic Index for Multi-dimensional Ob- jects lOLl. http://repository, cmu. edu/cgi/view- content, cgi? article = 1563b-context = compsci,2015.
6Beckmann N, Kriegel H P, Schneider R, et al. The R -tree: an Efficient and Robust Access Method for Points and Rectangles[J]. ACM, 1990,19(2) : 322-331.
7Kamel I, Faloutsos C. Hilbert R-tree: An Im- proved R-tree Using Fractals[OL]. http://drum. lib. umd. edu/handle/1903/5366,1993.
8Kothuri R K V, Ravada S, Abugov D. Quadtree and R-tree Indexes in Oracle Spatial: A Comparison Using GIS Data[C]. The 2002 ACM SIGMOD In- ternational Conference on Management of Data, Wisconsin, USA, 2002.
9FuYC, Hu Z Y, Guo W, et al. QR-tree. a Hy- brid Spatial Index Structure[C]. Machine Learning and Cybernetics, 2003 International Conference, Xi'an, China, 2003.
