• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>ACM SIGMOD international conference on Management of data >Algorithms for creating indexes for very large tables without quiescing updates
【24h】

Algorithms for creating indexes for very large tables without quiescing updates

机译：用于在不停止更新的情况下为大型表创建索引的算法

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

摘要

As relational DBMSs become more and more popular and as organizations grow, the sizes of individual tables are increasing dramatically. Unfortunately, current DBMSs do not allow updates to be performed on a table while an index (e.g., a B+-tree) is being built for that table, thereby decreasing the systems' availability. This paper describes two algorithms in order to relax this restriction. Our emphasis has been to maximize concurrency, minimize overheads and cover all aspects of the problem. Builds of both unique and nonunique indexes are handled correctly. We also describe techniques for making the index-build operations restartable, without loss of all work, in case a system failure were to interrupt the completion of the creation of the index. In this connection, we also present algorithms for making a long sort of operation restartable. These include algorithms for the sort and merge phases of sorting.
机译：

随着关系型DBMS越来越流行，并且随着组织的发展，单个表的大小急剧增加。不幸的是，当前的DBMS不允许在为该表建立索引（例如，B + 树）时对表执行更新，从而降低了系统的可用性。本文介绍了两种算法，以放宽此限制。我们的重点是最大程度地提高并发性，最小化开销并涵盖问题的各个方面。唯一索引和非唯一索引的构建都可以正确处理。我们还将介绍使索引生成操作可重新启动而又不丢失所有工作的技术，以防系统故障中断索引创建的完成。在这方面，我们还提出了使较长的操作可重启的算法。其中包括用于排序的排序和合并阶段的算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号