QR-tree: A hybrid spatial index structure

International Conference on Machine Learning and Cybernetics

Volumn 1, Issue , 2003, Pages 459-463

  Fu, Yu Chen ^a   Hu, Zhi Yong ^a   Guo, Wei ^a   Zhou, Dong Ru ^a  

^a WUHAN UNIVERSITY   (China)

Author keywords

QR tree index; Quadtree R tree; Spatial database; Spatial index

Indexed keywords

COMPUTATIONAL METHODS; COSTS; DATA STRUCTURES; INDEXING (OF INFORMATION); LEARNING SYSTEMS; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

QR-TREE INDEX; QUADTREE R-TREE; SPATIAL DATABASES; SPATIAL INDEX;

DATABASE SYSTEMS;

EID: 1542320288     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Volker Gaede, Oliver Günther: Multidimensional Access Methods. ACM Computing Surveys 30(2): 170-231(1998)
2. Finkel, R.A. and J. L. Bentley, "Quad trees: a data structure for retrieval on composite keys," Acta Inform., 4:11-9, 1974
3. Samet, H., "The quadtree and related hierarchical data structures," ACM Computing Surveys, 16, June 1984
4. Samet, H., "An overview of quadtrees, octrees, and related hierachical data structures," In R. A. Earnshaw, editor, Theoretical Foundations of Computer Graphics and CAD. NATO ASI Series F, vol.40, pp. 51-68. Springer-Verlag, 1988
5. Antonin Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. on Management of Data pages 45-57, 1984
6. Comer, D. The Ubiquitous B-tree. ACM Computing Surveys 11(2). Pages 121-137, 1979
7. N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. ACM SIGMOD, pages 322-331, May 1990
8. nd Very Large DataBase Conference, pages 28-39, Mumbai (Bombay), India, 1996
9. Kamel. I and Faloutsos. C. Hubert R-tree: an improved R-tree using fractals. In Proc. of Int. Conf. of Information and Knowledge Management, pages 490-499, 1993