2Kamel I,Faloutos C.Hilbert R-tree: An Improved R-tree Using Fractals[].Proc of the th International Conference on Very Large Data Bases.1994
3Guttman A.R-tree: A dynamic index structure for spatial searching[].Procof the ACM SIGMOD Int’l Confon Management of Data(SIGMOD’).1984
4Huang P W,Lin H Y.Optimizingstorage utilization in R-tree dynamic index structure for spatial database[].Journal of System and software.2001
二级参考文献8
1Guttman A.R-tree:A Dynamic Index Structure for Spatial Searching[C].In:Proc.of 20^th Int.Conf.on Very Large Data Bases,Morgan Kaufmann,1984
2Beckmann N,Kriegel H P,Schneider R,et al.The R*-tree:An Efficient and Robust Access Method for Points and Rectangles[C].In:Proc.of ACM Intl.Conf.on the Management of Data (SIGMOD),1990.322～331
3Kamel I,Faloutsos C.Hilbert R-tree:An improved R-tree using fractals.In:Proc.of the 20^th VLDB,1994.500～509
4Huang P W,Lin P L,Lin H Y.Optimizing storage utilization in R-tree dynamic index structure for spatial database.Journal of Systems and Software,2001,55(2):291～299
5Brakatsoulas S,Pfoser D,Theodoridis Y.Revisiting R-Tree Construction Principles[C].In:Proc.of 6th East European Conf.on ADBIS,Slovakia,2002
7Bohm C,Berchtold S,Keim D A.Searching in high-dimensional spaces:Index structures for improving the performance of multimedia database.ACM Computing Surveys,2001,33(3):322～373
8Han J W,Kamber M.Data Mining:Concepts and Techniques[M].U.S:Morgan Kaufmann Publishers,Inc,2001
