Execution time analysis of a top-down R-tree construction algorithm☆
References (11)
- 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:...
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.
Copyright © 2006 Elsevier B.V. All rights reserved.