首页> 外文会议>Information and Communication Technologies, 2006. ICTTA '06. 2nd >Concurrent and Recoverable Restructuring Method for Database Indices
【24h】

Concurrent and Recoverable Restructuring Method for Database Indices

机译:数据库索引的并行和可恢复的重组方法

获取原文

摘要

In this paper, we present a top-down restructuring method for Bplusmntrees in which a structure modification such as page split or merge is executed as an atomic action. Each structure modification is logged using a single redo-only log record. The execution of each structure modification involves X-latching three pages at most on two adjacent levels of the Bplusmntree for short duration. A Bplusmntree structure modification, once executed to completion can never be undone no matter if the transaction that triggered such a structure modification commits or aborts later on. Recoverability of the Bplusmntree structure is guaranteed because the redo pass of our ARIES-based recovery protocol produces a structurally consistent tree. The method improves concurrency, simplifies recovery, reduces the amount of logging, and can be used in systems that use redo-only or redo-undo recovery protocols
机译:在本文中,我们提出了一种Bplusmntrees的自上而下的重组方法,其中结构修改(例如页面拆分或合并)作为原子动作执行。使用单个重做日志记录记录每个结构修改。每个结构修改的执行都涉及在短时间内在Bplusmntree的两个相邻级别上最多X锁存三个页面。 Bplusmntree结构修改一旦执行完毕就永远不会撤消,无论触发这种结构修改的事务以后提交还是中止。 Bplusmntree结构的可恢复性得到了保证,因为基于ARIES的恢复协议的重做过程会生成结构一致的树。该方法提高了并发性,简化了恢复,减少了日志记录的数量,并且可以在使用仅重做或重做撤消恢复协议的系统中使用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号