New linear node splitting algorithm for R-trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1262 LNCS, Issue , 1997, Pages 339-349

  Ang, C H ^a   Tan, T C ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; FORESTRY;

LINEAR TIME; NODE SPLITTING ALGORITHM; QUADRATIC TIME; QUERY PERFORMANCE; R-TREES;

TREES (MATHEMATICS);

EID: 84885607862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63238-7_38     Document Type: Conference Paper

References (8)

1. *-tree: An efficient and robust access method for points and rectangles. Proc. of the SIGMOD Conference, Atlantic City, NJ. (May 1990) 322-331
2. D. Greene: An implementation and performance analysis of spatial data access methods. Proc. of the 5th International Conference on Data Engineering. (1989) 606-615
3. Antonin Guttman: R-tree: A Dynamic Index Structure for Spatial Searching. Proc. of the SIGMOD Conference, Boston. (June 1984) 47-57
4. Ibrahim Kamel and Christos Faloutsos: Hubert R-tree: An improved R-tree Using Fractals. Proc. of the 20th VLDB Conference, Santiago, Chile. (May 1994) 500-508
5. Hanan Samet: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1989)
6. +-tree: A dynamic index for multi-dimensional objects. Proc. of 13th VLDB Conference, England, (1987) 507-518. Also available as Computer Science TR 1795, University of Maryland, College Park, MD (1987)
7. M. Stonebraker, T. Sellis, and E. Hanson: An Analysis of rule indexing implementations in data base systems. Proc. of the First International Conference on Expert Database Systems, Charleston, SC. (April 1986) 353-364
8. Ching-Der Tung, Wen-Chi Hou, and Jiang-Hsing Chu: Multi-Priority Tree: An Index Structure for Spatial Data. Proc. of 1994 International Computer Symposium. (1994) 1285-1290