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

Authors:
Houman Alborzi;Hanan Samet
Affiliations:
Department of Computer Science and Center for Automation Research, Institute for Advanced Computer Studies, University of Maryland, College Park, MD;Department of Computer Science and Center for Automation Research, Institute for Advanced Computer Studies, University of Maryland, College Park, MD
Venue:
Information Processing Letters
Year:
2007

Citing 9
Cited 2

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
Bulk-insertions into R-trees using the small-tree-large-tree approach

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
A greedy algorithm for bulk loading R-trees

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Direct spatial search on pictorial databases using packed R-trees

SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Generic Approach to Bulk Loading Multidimensional Index Structures

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)

Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)

Fast regridding of large, complex geospatial datasets

Proceedings of the 2nd International Conference on Computing for Geospatial Research & Applications
Parallel spatial query processing on GPUs using R-trees

Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data

Quantified Score

Hi-index	0.89

Visualization

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.