利索-全球专利检索

  1. 登录
  2. 注册
发明授权
US5276872A Concurrency and recovery for index trees with nodal updates using multiple atomic actions by which the trees integrity is preserved during undesired system interruptions 失效
具有节点更新的索引树的并发和恢复使用多个原子动作，在不期望的系统中断期间保留树完整性

  • 专利标题： Concurrency and recovery for index trees with nodal updates using multiple atomic actions by which the trees integrity is preserved during undesired system interruptions
  • 专利标题（中）： 具有节点更新的索引树的并发和恢复使用多个原子动作，在不期望的系统中断期间保留树完整性
  • 申请号： US720405
    申请日： 1991-06-25
  • 公开(公告)号： US5276872A
    公开(公告)日： 1994-01-04
  • 发明人: David B. Lomet , Betty J. Salzberg
  • 申请人： David B. Lomet , Betty J. Salzberg
  • 申请人地址： MA Maynard
  • 专利权人： Digital Equipment Corporation
  • 当前专利权人： Digital Equipment Corporation
  • 当前专利权人地址： MA Maynard
  • 主分类号： G06F11/00
  • IPC分类号： G06F11/00
Concurrency and recovery for index trees with nodal updates using multiple atomic actions by which the trees integrity is preserved during undesired system interruptions
摘要：
The present invention includes an approach to index tree structure changes which provides high concurrency while being usable with many recovery schemes and with many varieties of index trees. The present invention permits multiple concurrent structure changes. In addition, all update activity and structure change activity above the data level executes in short independent atomic actions which do not impede normal database activity. Only data node splitting executes in the context of a database transaction. This feature makes the approach usable with diverse recovery mechanisms, while only impacting concurrency in a modest way. Even this impact can be avoided by re-packaging the atomic actions, at the cost of requiring more from the recovery system.
摘要（中）：

本发明包括索引树结构变化的方法，其提供高并发性，同时可用于许多恢复方案和许多种类的索引树。 本发明允许多个并发结构改变。 此外，数据级别以上的所有更新活动和结构更改活动都会在短时间内执行，而不会妨碍正常的数据库活动。 只有数据节点分割在数据库事务的上下文中执行。 此功能使该方法可用于各种恢复机制，同时仅以适度的方式影响并发。 即使这种影响可以通过重新打包原子行动来避免，以牺牲更多的恢复系统为代价。

公开/授权文献
信息查询
Global Dossier Espacenet
0/0