• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议> >RING: a strategy for minimizing the cost of online data placement reorganization for B-tree indexed database over shared-nothing parallel machines
【24h】

RING: a strategy for minimizing the cost of online data placement reorganization for B-tree indexed database over shared-nothing parallel machines

机译：RING：一种策略，用于最大程度地减少无共享并行机上B树索引数据库的在线数据放置重组的成本

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Proposes a new strategy called RING that utilizes a ring configuration of the range partition strategy to achieve efficient online data placement reorganization in shared-nothing environments. In the event of reorganization, it has been observed that the range partition strategy in its well-known linear configuration can lead to two main drawbacks: high reorganization costs and performance dependence on hotspot locations in a system. Thus, we modify the configuration into a ring, seeking to minimize the effect of these drawbacks. We also introduce a new standalone heat-balancing algorithm to support the ring configuration, where its migration decisions are deduced by taking into account reorganization costs while balancing a system. RING is based on simple but effective approaches that incur little overhead, so that performance is almost optimized for free. Our simulation results indicate that, under a wide range of requirements, performance can be considerably improved by modifying the underlying structure to support the ring configuration.
机译：提出了一种名为RING的新策略，该策略利用范围分区策略的环形配置在无共享环境中实现有效的在线数据放置重组。在进行重组的情况下，已经观察到，众所周知的线性配置中的范围划分策略可能导致两个主要缺陷：重组成本高以及对系统中热点位置的性能依赖性。因此，我们将配置修改为环形，以尽量减少这些缺点的影响。我们还引入了一种新的独立热平衡算法来支持环网配置，该环网配置的迁移决策是通过在平衡系统的同时考虑重组成本来得出的。 RING基于简单但有效的方法，几乎​​不会产生任何开销，因此几乎可以免费优化性能。我们的仿真结果表明，在广泛的要求下，可以通过修改底层结构以支持环结构来显着提高性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号