The Community for Technology Leaders
IEEE International Performance Computing and Communications Conference (2011)
Orlando, FL, USA
Nov. 17, 2011 to Nov. 19, 2011
ISBN: 978-1-4673-0010-0
pp: 1-8
Shahin Kamali , David R. Cheriton School of Computer Science, University of Waterloo
Pedram Ghodsnia , David R. Cheriton School of Computer Science, University of Waterloo
Khuzaima Daudjee , David R. Cheriton School of Computer Science, University of Waterloo
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.
INDEX TERMS
CITATION
Shahin Kamali, Pedram Ghodsnia, Khuzaima Daudjee, "Dynamic data allocation with replication in distributed systems", IEEE International Performance Computing and Communications Conference, vol. 00, no. , pp. 1-8, 2011, doi:10.1109/PCCC.2011.6108075
86 ms
(Ver 3.3 (11022016))