A mechanism to detect changing access patterns and automatically migrate distributed R-tree indexed multidimensional data

Authors:
Scott T. Leutenegger;Rostislav M. Sheykhet;Mario A. López
Affiliations:
Mathematics and Computer Science Department, University of Denver, Denver, CO;Mathematics and Computer Science Department, University of Denver, Denver, CO;Mathematics and Computer Science Department, University of Denver, Denver, CO
Venue:
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Year:
2000

Citing 12
Cited 0

Parallel R-trees

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Distributed algorithms for dynamic replication of data

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Algorithms for loading parallel grid files

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads

CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
An adaptive data replication algorithm

ACM Transactions on Database Systems (TODS)
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
An economic paradigm for query processing and data migration in mariposa

PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Declustering Spatial Databases on a Multi-Computer Architecture

EDBT '96 Proceedings of the 5th 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
A Multiuser Performance Analysis of Alternative Declustering Strategies

Proceedings of the Sixth International Conference on Data Engineering
Master-Client R-Trees: A New Parallel R-Tree Architecture

SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm to migrate multidimensional data in a non-replicated distributed environment. Our proposed algorithm is intented to improve query performance for mobile objects. Our algorithm automatically detects access pattern changes and migrates portions of the data from current sites of residence to sites recently accessing the data most frequently, thus reducing remote communication costs. We assume the data is indexed by an R-tree multidimensional index and that a global R-tree is used to locate and retrieve portions of the data set. We present a distributed R-tree structure and experimentally explore a specific access detection and migration mechanism. Our experimental results show that when compared to the no-migration case, and depending on network speed, our migration scheme may result in a query time reduction of a few percent to an order of magnitude.