DYFRAM: Dynamic fragmentation and replica management in distributed database systems

44Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to replicate and how to allocate the fragments to the sites are challenging problems that has previously been solved either by static fragmentation, replication and allocation, or based on a priori query analysis. Many emerging applications of distributed database systems generate very dynamic workloads with frequent changes in access patterns from different sites. In such contexts, continuous refragmentation and reallocation can significantly improve performance. In this paper we present DYFRAM, a decentralized approach for dynamic table fragmentation and allocation in distributed database systems based on observation of the access patterns of sites to tables. The approach performs fragmentation, replication, and reallocation based on recent access history, aiming at maximizing the number of local accesses compared to accesses from remote sites. We show through simulations and experiments on the DASCOSA distributed database system that the approach significantly reduces communication costs for typical access patterns, thus demonstrating the feasibility of our approach. © 2010 Springer Science+Business Media, LLC.

Cite

CITATION STYLE

APA

Hauglid, J. O., Ryeng, N. H., & Nørvåg, K. (2010). DYFRAM: Dynamic fragmentation and replica management in distributed database systems. Distributed and Parallel Databases, 28(2–3), 157–185. https://doi.org/10.1007/s10619-010-7068-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free