Enhanced schemes for data fragmentation, allocation, and replication in distributed database systems

5Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

With the growth of information technology and computer networks, there is a vital need for optimal design of distributed databases with the aim of performance improvement in terms of minimizing the round-trip response time and query transmission and processing costs. To address this issue, hew fragmentation, data allocation, and replication techniques are required. In this paper, we propose enhanced vertical fragmentation, allocation, and replication schemes to improve the performance of distributed database systems. The proposed fragmentation scheme clusters highly-bonded attributes (i.e.,) normally accessed together into a single fragment in order to minimize the query processing cost. The allocation scheme is proposed to find an optimized allocation to minimize the round-trip response time. The replication scheme partially replicates the fragments to increase the local execution of queries in a way that minimizes the cost of transmitting replicas to the sites. Experimental results show that, on average, the proposed schemes reduce the rpund-trip response time of queries by 23% and query processing cost by 15%, as compared to the related work.

Cite

CITATION STYLE

APA

Torshiz, M. N., Esfaji, A. S., & Amintoosi, H. (2020). Enhanced schemes for data fragmentation, allocation, and replication in distributed database systems. Computer Systems Science and Engineering, 35(2), 99–112. https://doi.org/10.32604/csse.2020.35.099

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