Branch grafting method for R-tree implementation

Journal of Systems and Software

Volumn 53, Issue 1, 2000, Pages 83-93

  Schreck, T ^a   Chen, Z ^a  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA MINING; DATABASE SYSTEMS; ONLINE SYSTEMS; TREES (MATHEMATICS);

BRANCH GRAFTING METHODS; ONLINE ANALYTICAL PROCESSING (OLAP); SPATIAL DATA;

DATA STRUCTURES;

EID: 0034228497     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(00)00057-1     Document Type: Article

References (16)

1. Ang, C.-H., Tan, T.C., 1999. New linear node splitting algorithm for R-trees. In: Proceedings of the SSD 1999, pp. 339-349.
2. Asato, B., Chen, Z., 1994. Branch-grafting heuristic for R-tree implementation. Working Paper, Department of Computer Science, University of Nebraska at Omaha.
3. Beckmann, N., Kriegel, H., Schneider, R., Seeger, B., 1990, The R*-tree: an efficient and robust access method for points and rectangles. In: ACM-SIGMOND, pp. 322-331.
4. Garcia, Y.J., Lopez, M.A., Leutenegger, S.T., 1998. On optimal node splitting for R-trees. In: Proceedings of the Very Large Data Base (VLDB), 1998, pp. 334-344.
5. Greene, D., 1989. An implementation and performance analysis of spatial data access methods. In: Proceedings of the Fifth International Conference on Data Engineering, pp. 606-615.
6. Guttman, A., 1984. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM-SIGMOND Conference on Management of Data, pp. 47-57.
7. Kamel, I., Faloutsos, C., 1995. Hilbert R-tree: an improved R-tree using fractals. In: Proceedings of the 1995 International Conference on VLDB.
8. Kamel, I., Faloutsos, C., 1993. On packing R-trees. In: Proceedings of the Second International Conference on Information and Knowledge Management, pp. 490-499.
9. Koperski, K., Adhikary, J., Han, J., 1996. Spatial data mining: progress and challenges. In: Proceedings of 1996 SIGMOD'96 Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'96), Montreal, Canada.
10. Kotidis, Y., Roussopoulos, N., 1998. An alternative storage organization for ROLAP aggregate views based on cubetrees. In: Proceedings of the ACM-SIGMOD, pp. 249-258.
11. Prioetti, G., Faloutsos, C., 1999. I/O complexity for range queries on region data stored using an R-tree. In: Proceedings of ICDE 1999, pp. 625-635.
12. Roussopoulos, N., Leifker, D., 1985. Direct spatial search on pictorial databases using packed R-trees. In: Proceedings of the 1985 ACM-SIGMOD, pp. 17-31.
13. Samet H. Hierarchical representations of collections of small rectangles. ACM Computing Surveys. 20(4):1988;272-309.
14. Sellis, T., Roussopoulos, N., Faloutsos, C., 1987. The R+-tree: a dynamic index for multi-dimensional objects. In: Proceedings of the 13th VLDB Conference, pp. 507-517.
15. Theodoridis, Y., Sellis, T., 1999. A model for the prediction of R-tree performance. In: Proceedings of the PODS 1999, pp. 161-171.
16. Van Oosterom P. Reactive Data Structures for Geographic Information Systems. 1993;Oxford Press, Oxford.