A new R-tree node splitting algorithm using MBR partition policy

2009 17th International Conference on Geoinformatics, Geoinformatics 2009

Volumn , Issue , 2009, Pages

  Liu, Yan ^a   Fang, Jinyun ^a   Han, Chengde ^a  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

Author keywords

GIS; Multi dimensional data index; Node splitting algorithm; R tree; Spatial database

Indexed keywords

CAD SYSTEM; CONSTRUCTION COSTS; DISK BLOCK; GEOGRAPHICAL INFORMATION SYSTEM; INDEX NODES; INDEXING TECHNIQUES; MINIMUM BOUNDING RECTANGLE; MULTIDIMENSIONAL DATA; NODE SPLITTING ALGORITHM; QUERY PERFORMANCE; R-TREES; REAL WORLD DATA; SPATIAL DATABASE; SPLITTING ALGORITHMS; SPLITTING NODES; TREE NODES; TREE STRUCTURES;

DECISION TREES; EXPERIMENTS; GEOGRAPHIC INFORMATION SYSTEMS; QUERY LANGUAGES;

ALGORITHMS;

EID: 74349113317     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GEOINFORMATICS.2009.5293260     Document Type: Conference Paper

References (8)

1. C.-H. Ang and T. C. Tan, "New linear node splitting algorithm for rtrees," in SSD '97: Proceedings of the 5th International Symposium on Advances in Spatial Databases. London, UK: Springer-Verlag, 1997, pp. 339-349.
2. *-tree: an efficient and robust access method for points and rectangles," in SIGMOD '90: Proceedings of the 1990 ACM SIGMOD international conference on Management of data. New York, NY, USA: ACM, 1990, pp. 322-331.
3. M. Blum, R. W.Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, "Time bounds for selection," Journal of Computer and System Sciense, vol. 7, no. 4, pp. 448-461, August 1972.
4. V. Gaede and O. Günther, "Multidimensional access methods," ACM Comput. Surv, vol. 30, no. 2, pp. 170-231, 1998.
5. Y J. García, M. A. Lopez, and S. T. Leutenegger, "On optimal node splitting for r-trees," in VLDB '98: Proceedings of the 24rd International Conference on Very Large Data Bases. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1998, pp. 334-344.
6. A. Guttman, "R-trees: a dynamic index structure for spatial searching," in SIGMOD '84: Proceedings of the 1984 ACM SIGMOD international conference on Management of data. New York, NY, USA: ACM, 1984, pp. 47-57.
7. I. Kamel and C. Faloutsos, "On packing r-trees," in CIKM '93: Proceed-ings of the second international conference on Information and knowledge management. New York, NY, USA: ACM, 1993, pp. 490-499.
8. B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer, "Towards an analysis of range query performance in spatial data structures," in PODS '93: Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. New York, NY, USA: ACM, 1993, pp. 214-221.