Efficient Bulk Operations on Dynamic R-trees

Authors:
Lars Arge;Klaus Hinrichs;Jan Vahrenhold;Jeffrey Scott Vitter
Affiliations:
-;-;-;-
Venue:
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Year:
1999

Citing 24
Cited 8

The input/output complexity of sorting and related problems

Communications of the ACM
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
An introduction to disk drive modeling

Computer
Partition based spatial-merge join

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Cubetree: organization of and bulk incremental updates on the data cube

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations

EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
STR: A Simple and Efficient Algorithm for R-Tree Packing

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
An Implementation and Performance Analysis of Spatial Data Access Methods

Proceedings of the Fifth International Conference on Data Engineering
A Generic Approach to Bulk Loading Multidimensional Index Structures

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Scalable Sweeping-Based Spatial Join

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Client-Server Paradise

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
External-Memory Algorithms with Applications in GIS

Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
Spatial Data Structures: Concepts and Design Choices

Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
An asymptotically optimal multiversion B-tree

The VLDB Journal — The International Journal on Very Large Data Bases
Supporting I/O-efficient scientific computation in TPIE

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing

GBI: A Generalized R-Tree Bulk-Insertion Strategy

SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
LEDA-SM Extending LEDA to Secondary Memory

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
External Memory Data Structures

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing

ACM Transactions on Database Systems (TODS)
Bulkloading updates for moving objects

WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Sort-based parallel loading of R-trees

Proceedings of the 1st ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
Indexing methods for moving object databases: games and other applications

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
RCached-tree: an index structure for efficiently answering popular queries

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple lazy buffering technique for performing bulk operations on multidimensional spatial indexes (data structures), and show that it is efficient in theory as well as in practice. We present the technique in terms of the so-called R-tree and its variants, as they have emerged as practically efficient indexing methods for spatial data.