Concurrent maintenance of data systems for telecommunications
The Computer Journal
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
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Distributing a search tree among a growing number of processors
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Implementing global memory management in a workstation cluster
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
On-line reorganization of sparsely-populated B+-trees
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Building a scaleable geo-spatial DBMS: technology, implementation, and evaluation
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Caching multidimensional queries using chunks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
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 comparison of receiver-initiated and sender-initiated adaptive load sharing (extended abstract)
SIGMETRICS '85 Proceedings of the 1985 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Towards self-tuning data placement in parallel database systems
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Microsoft TerraServer: a spatial data warehouse
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
On algorithms for efficient data migration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STHoles: a multidimensional workload-aware histogram
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
k-RP*s: a scalable distributed data structure for high-performance multi-attribute access
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
An efficient method for distributing search structures
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Flexible bandwidth allocation in high-capacity packet switches
IEEE/ACM Transactions on Networking (TON)
R-tree-based data migration and self-tuning strategies in shared-nothing spatial databases
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Dynamic multidimensional histograms
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Fast incremental maintenance of approximate histograms
ACM Transactions on Database Systems (TODS)
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Nearest Neighbor Queries in Shared-Nothing Environments
Geoinformatica
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
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
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Safely and Efficiently Updating References During On-line Reorganization
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
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th 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
High-Concurrency Locking in R-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
GBI: A Generalized R-Tree Bulk-Insertion Strategy
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
Synchronization and recovery in a client-server storage system
The VLDB Journal — The International Journal on Very Large Data Bases
A taxonomy of correctness criteria in database applications
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms for data migration with cloning
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DAC '84 Proceedings of the 21st Design Automation Conference
Master-Client R-Trees: A New Parallel R-Tree Architecture
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Parallel bulk-loading of spatial data
Parallel Computing - Special issue: High performance computing with geographical data
Bulk Operations for Space-Partitioning Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Spatio-Temporal Data Services in a Shared-Nothing Environment
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
TCP/IP Essentials: A Lab-Based Approach
TCP/IP Essentials: A Lab-Based Approach
SensEye: a multi-tier camera sensor network
Proceedings of the 13th annual ACM international conference on Multimedia
Queue - Object-Relational Mapping
Hi-index | 0.00 |
Contemporary applications continuously modify large volumes of multidimensional data that must be accessed efficiently and, more importantly, must be updated in a timely manner. Single-server storage approaches are insufficient when managing such volumes of data, while the high frequency of data modification render classical indexing methods inefficient. To address these two problems we introduce a distributed storage manager for multidimensional data based on a Cluster-of-Workstations. The manager addresses the above challenges through a set of mechanisms that, through selective on-line data reorganization, collectively maintain a balanced load across a cluster of workstations. With the help of both a highly efficient and speedy self-tuning mechanism, based on a new data structure called stat-index, as well as a query aggregation and clustering algorithm, our storage manager attains short query response times even in the presence of massive modifications and highly skewed access patterns. Furthermore, we provide a data migration cost model used to determine the best data redistribution strategy. Through extensive experimentation with our prototype, we establish that our storage manager can sustain significant update rates with minimal overhead.