Dynamic data allocation with replication in distributed systems
Authors:
- 1 November 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10972641,p. 1-8
Abstract
The goal of fragment allocation in distributed database systems is to place data fragments at sites so as to minimize the overall data transmission cost incurred to answer queries. We consider the problem of fragment allocation in lazily replicated systems and address both placement and replication issues in an integrated approach. While replication can improve performance via increased locality, excessive replication can incur extra overhead cost to maintain replicas. A comprehensive model that takes into account network topology, fragment correlation, and data access patterns is presented. Based on this model, we propose an algorithm to find near-optimal dynamic allocation solutions. Experimental results show the efficacy of the proposed solution.Keywords
This publication has 16 references indexed in Scilit:
- Distributed Facility Location Algorithms for Flexible Configuration of Wireless Sensor Networks2007
- A Constant-Factor Approximation Algorithm for the k-Median ProblemJournal of Computer and System Sciences, 2002
- Database fragmentation and allocation: an integrated methodology and case studyIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 1998
- A constrained nonlinear 0–1 program for data allocationEuropean Journal of Operational Research, 1997
- An adaptive data replication algorithmACM Transactions on Database Systems, 1997
- The dangers of replication and a solutionACM SIGMOD Record, 1996
- A genetic algorithm for fragment allocation in a distributed database system1994
- Data allocation in distributed database systemsACM Transactions on Database Systems, 1988
- A heuristic for the p-center problems in graphsDiscrete Applied Mathematics, 1987
- Some theorems to aid in solving the file allocation problemCommunications of the ACM, 1977