[1] Robinson J T. The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Index[C]//Proc. of ACM SIGMOD International Conference on Management of Data. New York, USA: ACM Press, 1981: 10-18.
[2] Henrich A, Six H, Widmayer P. The LSD Tree: Spatial Access to Multidimensional Point and Nonpoint Objects[C]//Proc. of the 15th International Conference on Very Large Data Bases. San Francisco, USA: Morgan Kaufmann Publishers Inc., 1989: 45-53.
[3] Guttman A. R-trees: A Dynamic Index Structures for Spatial Searching[C]//Proc. of ACM SIGMOD International Conference on Management of Data. New York, USA: ACM Press, 1984: 47-57.
[4] Bechman N, Kriegel H P, Schneider R, et al. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles[C]// Proc. of ACM SIGMOD International Conference on Management of Data. New York, USA: ACM Press, 1990: 322-331.
[5] Fu Yuchen, Hu Zhiyong, Guo Wei, et al. QR-Tree: A Hybrid Spatial Index Structure[C]//Proc. of International Conference on Machine Learning and Cybernetics. Xi’an, China: [s. n.], 2003: 459-463.
[6] Nievergelt J, Hinterberger H, Sevcik K C. The Grid File: An Adaptable Symmetric Multikey File Structure[J]. ACM Trans. on Database Systems, 1984, 9(1): 38-71.
[7] Zhang Mingbo, Lu Feng, Chen Changxiu, et al. A Forced Transplant Algorithm for Dynamic R-tree Implementation[C]//Lecture Notes in Computer Science. [S. l.]: Springer, 2006: 459-466.
[8] Zhang Donghui, Xia Tian. A Novel Improvement to the R*-tree Spatial Index Using Gain/Loss Metrics[C]//Proc. of the 12th Annual ACM International Workshop on Geographic Information Systems. New York, USA: ACM Press, 2004: 204-213.
[9] 张明波, 陆 锋, 申排伟, 等. R树家族的演变和发展[J]. 计算机学报, 2005, 28(3): 289-300.
[10] 张 丽, 吉根林. 一种基于线面包含关系的GML空间聚类算 法[J]. 山东大学学报: 工学版, 2009, 39(2): 21-25. |