Execution time analysis of a top-down R-tree construction algorithm

https://doi.org/10.1016/j.ipl.2006.07.010Get rights and content

Abstract

A detailed CPU execution-time analysis and implementation are given for a bulk loading algorithm to construct R-trees due to García et al. [Y.J. García, M.A. López, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, in: GIS'98: Proc. of the 6th ACM Intl. Symp. on Advances in Geographic Information Systems, Washington, DC, 1998, pp. 163–164] which is known as the top-down greedy split (TGS) bulk loading algorithm. The TGS algorithm makes use of a classical bottom-up packing approach. In addition, an alternative packing approach termed top-down packing is introduced which may lead to improved query performance, and it is shown how to incorporate it into the TGS algorithm. A discussion is also presented of the tradeoffs of using the bottom-up and top-down packing approaches.

References (11)

  • L. Arge et al.

    Efficient bulk operations on dynamic R-trees

  • N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, The R∗-tree: An efficient and robust access method for points and...
  • L. Chen, R. Choubey, E.A. Rundensteiner, Bulk-insertions into R-trees using the Small-Tree-Large-Tree approach, in:...
  • D. Comer

    The ubiquitous B-tree

    ACM Comput. Surv.

    (1979)
  • Y.J. García, M.A. López, S.T. Leutenegger, A greedy algorithm for bulk loading R-trees, Computer Science Technical...
There are more references available in the full text version of this article.

Cited by (0)

The support of the National Science Foundation under Grants EIA-00-91474 and CCF-0515241, Microsoft Research, and the University of Maryland General Research Board is gratefully acknowledged.

View full text