首页> 外文会议>2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems >An optimized scheme for vertical fragmentation, allocation and replication of a distributed database
【24h】

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

机译:用于分布式数据库的垂直分段,分配和复制的优化方案

获取原文
获取原文并翻译 | 示例

摘要

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元分区的情况下进行迭代二进制分区,这将增加复杂度和用于计算的预定阈值。增强结果以及更多计算的问题。因此,在本文中,我们提出了称为(VFAR)的分布式数据库的垂直分段,分配和复制方案。所提出的方案在分布式数据库设计的初始阶段垂直地划分了分布式数据库关系,而不需要在此阶段尚不可用的用户查询频率。它还使用对每个片段的每个站点的操作和读取操作,将结果片段分配并复制到分布式数据库的站点。实验结果表明:所提出的方案减少了先前的垂直划分方法的开销和复杂计算的复杂性。其次,它解决了在初始阶段不可用的用户查询频率的问题。第三,通过生成一次迭代的所有片段,解决了在n元分区情况下迭代二进制分区的问题。最终,它无需确定用于增强结果的阈值即可获得最佳结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号