An optimized scheme for vertical fragmentation, allocation and replication of a distributed database

Ahmed E. Abdel Raouf, N. Badr, M. Tolba
{"title":"An optimized scheme for vertical fragmentation, allocation and replication of a distributed database","authors":"Ahmed E. Abdel Raouf, N. Badr, M. Tolba","doi":"10.1109/INTELCIS.2015.7397268","DOIUrl":null,"url":null,"abstract":"Distributed databases have become the most essential technology for recent business organizations. One of the main issues of the distributed database management system (DDBMS) is the distributed database design. The performance and efficiency of a distributed database design largely depend on the fragmentation of global relations. It also depends on the allocation and replication of those fragments to several sites of the network. Earlier approaches suggest vertical fragmentation solutions based on the frequency of the user queries. However, these approaches have the limitation of higher complexity and availability of the frequency of user queries at the initial stage of the database design, iterative binary partitioning in case of n-ary partitioning which will increase the complexity and predetermined threshold value that is used to enhance the results, as well as the problem of more computation. Consequently in this paper, we present a vertical fragmentation, allocation and replication scheme of a distributed database called (VFAR). The proposed scheme partitions the distributed database relations vertically at the initial stage of distributed database design, without the need for the frequency of user queries which are not available at this stage. It also allocates and replicates the resulted fragments to the sites of the distributed database, using manipulates and read operations of each site to each fragment. Experimental results showed that firstly; the proposed scheme reduces the overheads and the complexity of complicated computations of previous vertical partitioning approaches. Secondly, it solves the problem of the frequency of the user queries that are not available at the initial stage. Thirdly, it solves the problem of iterative binary partitioning in the case of n-ary partitioning by generating all fragments of one iteration. Finally, it gets the optimal results without the need to determine a threshold value that is used to enhance the results.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":"44 1","pages":"506-513"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTELCIS.2015.7397268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Distributed databases have become the most essential technology for recent business organizations. One of the main issues of the distributed database management system (DDBMS) is the distributed database design. The performance and efficiency of a distributed database design largely depend on the fragmentation of global relations. It also depends on the allocation and replication of those fragments to several sites of the network. Earlier approaches suggest vertical fragmentation solutions based on the frequency of the user queries. However, these approaches have the limitation of higher complexity and availability of the frequency of user queries at the initial stage of the database design, iterative binary partitioning in case of n-ary partitioning which will increase the complexity and predetermined threshold value that is used to enhance the results, as well as the problem of more computation. Consequently in this paper, we present a vertical fragmentation, allocation and replication scheme of a distributed database called (VFAR). The proposed scheme partitions the distributed database relations vertically at the initial stage of distributed database design, without the need for the frequency of user queries which are not available at this stage. It also allocates and replicates the resulted fragments to the sites of the distributed database, using manipulates and read operations of each site to each fragment. Experimental results showed that firstly; the proposed scheme reduces the overheads and the complexity of complicated computations of previous vertical partitioning approaches. Secondly, it solves the problem of the frequency of the user queries that are not available at the initial stage. Thirdly, it solves the problem of iterative binary partitioning in the case of n-ary partitioning by generating all fragments of one iteration. Finally, it gets the optimal results without the need to determine a threshold value that is used to enhance the results.
分布式数据库垂直分片、分配和复制的优化方案
分布式数据库已经成为当今商业组织最基本的技术。分布式数据库管理系统(DDBMS)的主要问题之一是分布式数据库的设计。分布式数据库设计的性能和效率在很大程度上取决于全局关系的碎片化。它还取决于这些片段在网络的几个站点上的分配和复制。早期的方法建议基于用户查询频率的垂直碎片化解决方案。然而,这些方法在数据库设计的初始阶段具有较高的复杂性和用户查询频率的可用性,在n-ary分区情况下迭代二进制分区会增加复杂性和用于增强结果的预定阈值,以及计算量较大的问题。因此,在本文中,我们提出了一个分布式数据库(VFAR)的垂直分片、分配和复制方案。该方案在分布式数据库设计的初始阶段对分布式数据库关系进行垂直分区,而不需要用户查询的频率,这在这个阶段是不可用的。它还将结果片段分配并复制到分布式数据库的站点,使用每个站点对每个片段的操作和读取操作。实验结果表明:首先;该方案降低了以往垂直划分方法的开销和复杂计算的复杂性。其次,它解决了用户查询在初始阶段不可用的频率问题。第三,通过生成一次迭代的所有片段,解决了n元划分情况下的迭代二叉划分问题。最后,它可以获得最佳结果,而不需要确定用于增强结果的阈值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信