Bulk insertion for R-trees by seeded clustering

Data and Knowledge Engineering

Volumn 59, Issue 1, 2006, Pages 86-106

  Lee, Taewon ^a   Moon, Bongki ^b   Lee, Sukho ^a  

^a Seoul National University   (South Korea)

^b University of Arizona   (United States)

Author keywords

Bulk insertion; R tree; Repacking; Seed tree; Seeded clustering

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); DATA ACQUISITION; DATA PROCESSING; DISTRIBUTED COMPUTER SYSTEMS; TREES (MATHEMATICS);

BULK INSERTION; R-TREE; REPACKING; SEED TREE; SEEDED CLUSTERING;

KNOWLEDGE ENGINEERING;

EID: 33746381542     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2005.07.011     Document Type: Article

References (17)

1. A. Guttman, R-Trees: a dynamic index structure for spatial searching, in: Proceedings of the 1984 ACM-SIGMOD Conference, 1984, pp. 47-57.
2. L. Chen, R. Choubey, E.A. Rundensteiner, Bulk-insertions into R-trees using the small-tree-large-tree approach, in: Proceedings of the sixth ACM International symposium on Advances in geographic information systems, 1998, pp. 161-162.
3. R. Choubey, L. Chen, E.A. Rundensteiner, GBI: A Generalized R-tree Bulk-Insertion Strategy, in: Advances in Spatial Databases, 1997, pp. 91-108.
4. I. Kamel, M. Khalil, V. Kouramajian, Bulk insertion in dynamic R-trees, in: Proceedings of the 4th International Symposium on Spatial Data Handling (SDH'96), 1996, pp. 3B.31-3B.42.
5. Arge L., Hinrichs K.H., Vahrenhold J., and Vitter J.S. Efficient bulk operations on dynamic R-trees. Algorithmica 33 1 (2002) 104-128
6. Arge L. The buffer tree: a new technique for optimal i/o-algorithms. Lecture Notes in Computer Science 955 (1993) 334-345
7. M.-L. Lo, C.V. Ravishankar, Spatial joins using seeded trees, in: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, 1994, pp. 209-220.
8. I. Kamel, C. Faloutsos, On packing R-trees, in: Proceedings of the second International Conference on Information and Knowledge Management, 1993, pp. 490-499.
9. S.T. Leutenegger, J.M. Edgington, M.A. Lopez, STR: A Simple and Efficient Algorithm for R-Tree Packing, in: Proceedings of the IEEE Data Engineering, 1997, pp. 497-506.
10. N. Roussopoulos, D. Leifker, Direct spatial search on pictorial databases using packed R-trees, in: Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, 1985, pp. 17-31.
11. Y.J. García, M.A. Lopez, S.T. Leutenegger, A Greedy Algorithm for Bulk Loading R-Trees, in: ACM-GIS '98, Proceedings of the 6th International symposium on Advances in Geographic Information Systems, November, 1998, pp. 163-164.
12. J.V. den Bercken, B. Seeger, P. Widmayer, A Generic Approach to Bulk Loading Multidimensional Index Structures, in: Proceedings of 23rd International Conference on Very Large Data Bases, August, 1997, pp. 406-415.
13. Y. Garcia, M.A. Lopez, S.T. Leutenegger, Post-optimization and Incremental Refinement of R-trees, in: Proceedings of the 1999 ACM GIS International Conference on Geographical Information System, 1999, pp. 91-96.
14. *-tree: an efficient and robust access method for points and rectangles, in: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, 1990, pp. 322-331.
15. TIGER/Line Files, Technical Documentation, US Bureau of Census, Washington, DC (2000). Available from: .
16. Y. Theodoridis, The r-tree-portal (2003). Available from: .
17. J. Gray, P. Sundaresan, S. Englert, K. Baclawski, P.J. Weinberger, Quickly generating billion-record synthetic databases, in: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, 1994, pp. 243-252.