Heuristic Approach to Dynamic Data Allocation in Distributed Database Systems

2003 ◽  
Vol 2 (3) ◽  
pp. 231-239 ◽  
Author(s):  
Tolga Ulus . ◽  
Mithat Uysal .
Keyword(s):  
Database Systems ◽  
Distributed Database ◽  
Heuristic Approach ◽  
Data Allocation ◽  
Dynamic Data ◽  
Distributed Database Systems

Algorithm Development, Simulation Analysis and Parametric Studies for Data Allocation in Distributed Database Systems

2002 ◽  
pp. 157-189
Author(s):  
Amita Goyal Chin
Keyword(s):  
Simulation Analysis ◽  
Database Systems ◽  
Distributed Database ◽  
Database System ◽  
Data Allocation ◽  
Distributed Database Systems ◽  
Data Reorganization ◽  
Incremental Growth ◽  
Efficient Data ◽  
Distributed Database System

In a distributed database system, an increase in workload typically necessitates the installation of additional database servers followed by the implementation of expensive data reorganization strategies. We present the Partial REALLOCATE and Full REALLOCATE heuristics for efficient data reallocation. Complexity is controlled and cost minimized by allowing only incremental introduction of servers into the distributed database system. Using first simple examples and then, a simulator, our framework for incremental growth and data reallocation in distributed database systems is shown to produce near optimal solutions when compared with exhaustive methods.

Incremental Data Allocation and Reallocation in Distributed Database Systems

2011 ◽  
pp. 137-160 ◽  
Author(s):  
Amita Goyal Chin
Keyword(s):  
Database Systems ◽  
Distributed Database ◽  
Database System ◽  
Data Allocation ◽  
Distributed Database Systems ◽  
Data Reorganization ◽  
Incremental Growth ◽  
Efficient Data ◽  
Distributed Database System ◽  
Database Servers

In a distributed database system, an increase in workload typically necessitates the installation of additional database servers followed by the implementation of expensive data reorganization strategies. We present the Partial REALLOCATE and Full REALLOCATE heuristics for efficient data reallocation. Complexity is controlled and cost minimized by allowing only incremental introduction of servers into the distributed database system. Using first simple examples and then, a simulator, our framework for incremental growth and data reallocation in distributed database systems is shown to produce near optimal solutions when compared with exhaustive methods.

Sign in / Sign up

Export Citation Format

Share Document