(Georgia Institute of Technology, 1995)
Omiecinski, Edward; Navathe, Shamkant B.; Achyutuni, Kiran Jyotsna
In this paper, we study the data placement problem from a reorganization
point of view. Effective placement of the declustered fragments of a
relation is crucial to the performance of parallel database systems
having multiple disks. Given the dynamic nature of database systems,
the optimal placement of fragments will change over time
and this will necessitate a reorganization in order to maintain
the performance of the database system at acceptable levels.
This study shows that the choice of a data placement strategy can
have a significant impact on the reorganization costs.
Up until now, data placement heuristics were designed with the
principal purpose of balancing the load. However, this paper
shows that such a policy can be beneficial only in the short term.
Long term database designs should take reorganization
costs into consideration while making design choices.