Algorithms for creating indexes for very large tables without quiescing updates
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Lazy updates for distributed search structure
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
On-line reorganization of sparsely-populated B+-trees
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Two techniques for on-line index modification in shared nothing parallel databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Database management systems
Snowball: Scalable Storage on Networks of Workstations with Balanced Load
Distributed and Parallel Databases
Indexing the edges—a simple and yet efficient approach to high-dimensional indexing
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Replicated indexes for distributed data
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Discrete Event Simulation in C
Discrete Event Simulation in C
Indexing Techniques for Advanced Database Systems
Indexing Techniques for Advanced Database Systems
A Case for NOW (Networks of Workstations)
IEEE Micro
Concurrent Storage Structure Conversion: from B+ Tree to Linear Hash File
Proceedings of the Fourth International Conference on Data Engineering
Concurrent File Reorganization for Record Clustering: A Performance Study
Proceedings of the Eighth International Conference on Data Engineering
Safely and Efficiently Updating References During On-line Reorganization
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
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
Online Scaling in a Highly Available Database
Proceedings of the 27th International Conference on Very Large Data Bases
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
QoSMig: Adaptive Rate-Controlled Migration of Bulk Data in Storage Systems
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Self-tuning cost modeling of user-defined functions in an object-relational DBMS
ACM Transactions on Database Systems (TODS)
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Online balancing of range-partitioned data with applications to peer-to-peer systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Towards materialized view selection for distributed databases
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Dynamic Data Migration Policies for Query-Intensive Distributed Data Environments
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Online reorganization of databases
ACM Computing Surveys (CSUR)
Self-tuning management of update-intensive multidimensional data in clusters of workstations
The VLDB Journal — The International Journal on Very Large Data Bases
The Data Cyclotron query processing scheme
Proceedings of the 13th International Conference on Extending Database Technology
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Load balancing for moving object management in a P2P network
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Selection of nodes for distributing relations in parallel database
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 1
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
Towards elastic transactional cloud storage with range query support
Proceedings of the VLDB Endowment
PLP: page latch-free shared-everything OLTP
Proceedings of the VLDB Endowment
The data cyclotron query processing scheme
ACM Transactions on Database Systems (TODS)
Algorithms for the database layout problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
An on-line reorganization framework for SAN file systems
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
iBigTable: practical data integrity for bigtable in public cloud
Proceedings of the third ACM conference on Data and application security and privacy
Scalable and dynamically balanced shared-everything OLTP with physiological partitioning
The VLDB Journal — The International Journal on Very Large Data Bases
Eliminating unscalable communication in transaction processing
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
Parallel database systems are increasingly being deployed to support the performance demands of end-users. While declustering data across multiple nodes facilitates parallelism, initial data placement may not be optimal due to skewed workloads and changing access patterns. To prevent performance degradation, the placement of data must be reorganized, and this must be done on-line to minimize disruption to the system.In this paper, we consider a dynamic self-tuning approach to reorganization in a shared nothing system. We introduce a new index-based method that faciliates fast and efficient migration of data. Our solution incorporates a globally height-balanced structure and load tracking at different levels of granularity. We conducted an extensive performance study, and implemented the methods on the Fujitsu AP3000 machine. Both the simulation and empirical results demonstratic that our proposed method is indeed scalable and effective in correcting any deterioration in system throughput.