首页> 外文会议>2014 International Conference on Advances in Engineering and Technology Research >A comparative analysis of fragmentation selection algorithms for data warehouse partitioning
【24h】

A comparative analysis of fragmentation selection algorithms for data warehouse partitioning

机译:数据仓库分区碎片选择算法的比较分析

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

摘要

Enterprise data warehouse system maintains large amounts of data for enabling business analysis. The queries imposed on such system involves complex joins, aggregation and filter operations. Hence in order to enhance query performance the data warehouse needs to be tuned by optimization techniques such as partitioning. Referential horizontal partitioning performs better for data warehouse where the fact table is partitioned based on the dimension table. The number of fragments or partitions that is generated by horizontal partitioning might be very large to be managed in the underlying database. In literature few fragmentation selection algorithms have been proposed in order to choose optimal set of fragments. In this paper we provide a summary of different fragmentation selection algorithms and provide comparative analysis between them.
机译:企业数据仓库系统维护大量数据以进行业务分析。施加在此类系统上的查询涉及复杂的联接,聚合和筛选操作。因此,为了增强查询性能,需要通过诸如分区之类的优化技术来调整数据仓库。参照水平分区对于根据事实表对事实表进行分区的数据仓库而言,性能更好。水平分区生成的碎片或分区的数量可能非常大,无法在基础数据库中进行管理。在文献中,很少提出碎片选择算法以选择最佳的碎片集合。在本文中,我们总结了不同的碎片选择算法,并对它们进行了比较分析。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号