公开(公告)号：US08868514B2

公开(公告)日：2014-10-21

申请号：US12986962

申请日：2011-01-07

Applicant: David Lomet ,  Mohamed Mokbel ,  Justin Levandoski ,  Keliang Zhao

Inventor： David Lomet ,  Mohamed Mokbel ,  Justin Levandoski ,  Keliang Zhao

IPC: G06F7/00 ,  G06F17/00 ,  G06F15/16

CPC classification number: G06F17/30575

Abstract: A distributed system with transaction support may have a transaction component and one or more data components. The transaction component may manage a transaction using a log sequence number for each operation, and then transmit operations to one or more data components with log sequence numbers. The data components may perform the data operations in an idempotent manner and return a reply. The transaction component may then write the operation, its log sequence number, and information from the reply message to its log. The transaction component is able to commit a transaction, as well as retry or undo portions of a transaction, by using the information stored on its log. This may be possible even when a single transaction uses multiple data components, which may be located on different devices or manage separate and independent data sources.

Abstract translation: 具有事务支持的分布式系统可以具有事务组件和一个或多个数据组件。 交易组件可以使用每个操作的日志序列号来管理事务，然后将操作发送到具有日志序列号的一个或多个数据组件。 数据组件可以以幂等方式执行数据操作并返回答复。 然后，事务组件可以将操作，其日志序列号和从回复消息的信息写入其日志。 事务组件能够通过使用存储在其日志中的信息来提交事务以及重试或撤销事务的部分。 即使单个事务使用可能位于不同设备上的多个数据组件或管理独立和独立的数据源，这也是可能的。

公开(公告)号：US20120005168A1

公开(公告)日：2012-01-05

申请号：US12827941

申请日：2010-06-30

Applicant: David Lomet ,  Kostas Tzoumas

Inventor： David Lomet ,  Kostas Tzoumas

IPC: G06F17/30

CPC classification number: G06F11/1471

Abstract: This patent application relates to enhanced logical recovery techniques for redo recovery operations of a system with an unbundled storage engine. These techniques can be implemented by utilizing an enhanced logical recovery approach in which a dirty page table (DPT) is constructed based on information logged during normal execution. The unbundled storage engine can include a transaction component (TC) that is architecturally independent of a data component (DC). These techniques can enhance redo recovery operations by mitigating the resources needed to determine whether previously executed operations sent from the TC to the DC are to be repeated in response to a recovery-initiating event. This can include using the DPT to avoid fetching every data page corresponding to every previously executed operation received by the DC during recovery and/or pre-fetching data pages and/or index pages that correspond to PIDs in the DPT

Abstract translation: 该专利申请涉及用于具有非捆绑存储引擎的系统的重做恢复操作的增强的逻辑恢复技术。 这些技术可以通过利用增强的逻辑恢复方法来实现，其中基于在正常执行期间记录的信息来构造脏页表（DPT）。 非捆绑存储引擎可以包括在架构上独立于数据组件（DC）的事务组件（TC）。 这些技术可以通过减轻确定从TC发送到DC的先前执行的操作是否要响应于恢复发起事件而重复所需的资源来增强重做恢复操作。 这可以包括使用DPT来避免在恢复期间和/或预取数据页和/或与DPT中的PID相对应的索引页时获取对应于由DC接收的每个先前执行的每个操作的每个数据页

公开(公告)号：US20060090095A1

公开(公告)日：2006-04-27

申请号：US11225222

申请日：2005-09-12

Applicant: Michael Massa ,  David Dion ,  Rajsekhar Das ,  Rushabh Doshi ,  David Lomet ,  Gor Nishanov ,  Philip Bernstein ,  Rod Gamache ,  Rohit Jain ,  Sunita Shrivastava

Inventor： Michael Massa ,  David Dion ,  Rajsekhar Das ,  Rushabh Doshi ,  David Lomet ,  Gor Nishanov ,  Philip Bernstein ,  Rod Gamache ,  Rohit Jain ,  Sunita Shrivastava

IPC: G06F11/00

CPC classification number: G06F17/30575 ,  G06F11/1425 ,  G06F11/1471 ,  G06F11/1479 ,  G06F11/1482 ,  G06F11/1662 ,  G06F11/181 ,  G06F11/182 ,  G06F11/2023 ,  G06F11/2035 ,  G06F11/2058 ,  G06F2201/82

Abstract: A method and system for increasing server cluster availability by requiring at a minimum only one node and a quorum replica set of replica members to form and operate a cluster. Replica members maintain cluster operational data. A cluster operates when one node possesses a majority of replica members, which ensures that any new or surviving cluster includes consistent cluster operational data via at least one replica member from the immediately prior cluster. Arbitration provides exclusive ownership by one node of the replica members, including at cluster formation, and when the owning node fails. Arbitration uses a fast mutual exclusion algorithm and a reservation mechanism to challenge for and defend the exclusive reservation of each member. A quorum replica set algorithm brings members online and offline with data consistency, including updating unreconciled replica members, and ensures consistent read and update operations.

Abstract translation: 通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。 副本成员维护集群操作数据。 当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。 仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。 仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。 仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

公开(公告)号：US20060080670A1

公开(公告)日：2006-04-13

申请号：US10947707

申请日：2004-09-23

Applicant: David Lomet

Inventor： David Lomet

IPC: G06F9/44

CPC classification number: G06F11/1474 ,  G06F11/1479 ,  H04L69/40

Abstract: The present invention leverages a unilaterally-based interaction contract that enables applications to have a persistent state and ensures an exactly-once execution despite failures between and by communicating entities, permitting disparate software applications to be robustly supported in an environment where little is known about the implementation of the interaction contract. In one instance of the present invention, a web services interaction contract provides a communicating application with duplicate commit request elimination, persistent state transitions, and/or unique persistent reply requests. The present invention permits this interaction contract to be supported by, for example, a persistent application, a workflow, a transaction queue, a database, and a file system to facilitate in providing idempotent executions for requests from a communicating application.

Abstract translation: 本发明利用单方面的交互合同，使得应用能够具有持久状态，并确保即使在通信实体之间发生故障并且通过通信实体发生故障，从而允许不同的软件应用被强有力地支持在一个关于 互动合同的实施。 在本发明的一个实例中，Web服务交互协议为通信应用提供重复的提交请求消除，持久状态转换和/或唯一的持久应答请求。 本发明允许例如持续应用程序，工作流程，事务队列，数据库和文件系统来支持该交互合同，以便于为来自通信应用的请求提供幂等执行。

公开(公告)号：US20050066217A1

公开(公告)日：2005-03-24

申请号：US10977709

申请日：2004-10-29

Applicant: Roger Barga ,  David Lomet

Inventor： Roger Barga ,  David Lomet

IPC: G06F11/00 ,  G06F11/14 ,  H02H3/05

CPC classification number: G06F11/1482 ,  G06F11/1438 ,  G06F11/1471

Abstract: Persistent components are provided across both process and server failures, without the application programmer needing take actions for component recoverability. Application interactions with a stateful component are transparently intercepted and stably logged to persistent storage. A “virtual” component isolates an application from component failures, permitting the mapping of a component to an arbitrary “physical” component. Component failures are detected and masked from the application. A virtual component is re-mapped to a new physical component, and the operations required to recreate a component and reinstall state up to the point of the last logged interaction is replayed from the log automatically.

Abstract translation: 在进程和服务器故障之间提供持久组件，而不需要应用程序员采取措施来实现组件可恢复性。 与状态组件的应用程序交互被透明地拦截并稳定地记录到持久存储器中。 “虚拟”组件将应用程序与组件故障隔离，允许将组件映射到任意“物理”组件。 从应用程序检测并屏蔽组件故障。 一个虚拟组件被重新映射到一个新的物理组件，重新创建组件并重新安装状态直到上次记录的交互操作所需的操作将从日志自动重播。

公开(公告)号：US08930321B2

公开(公告)日：2015-01-06

申请号：US12827941

申请日：2010-06-30

Applicant: David Lomet ,  Kostas Tzoumas

Inventor： David Lomet ,  Kostas Tzoumas

IPC: G06F7/00 ,  G06F11/14

CPC classification number: G06F11/1471

Abstract: This patent application relates to enhanced logical recovery techniques for redo recovery operations of a system with an unbundled storage engine. These techniques can be implemented by utilizing an enhanced logical recovery approach in which a dirty page table (DPT) is constructed based on information logged during normal execution. The unbundled storage engine can include a transaction component (TC) that is architecturally independent of a data component (DC). These techniques can enhance redo recovery operations by mitigating the resources needed to determine whether previously executed operations sent from the TC to the DC are to be repeated in response to a recovery-initiating event. This can include using the DPT to avoid fetching every data page corresponding to every previously executed operation received by the DC during recovery and/or pre-fetching data pages and/or index pages that correspond to PIDs in the DPT.

Abstract translation: 该专利申请涉及用于具有非捆绑存储引擎的系统的重做恢复操作的增强的逻辑恢复技术。 这些技术可以通过利用增强的逻辑恢复方法来实现，其中基于在正常执行期间记录的信息来构造脏页表（DPT）。 非捆绑存储引擎可以包括在架构上独立于数据组件（DC）的事务组件（TC）。 这些技术可以通过减轻确定从TC发送到DC的先前执行的操作是否要响应于恢复发起事件被重复而需要的资源来增强重做恢复操作。 这可以包括使用DPT来避免在恢复期间和/或预取与DPT中的PID相对应的数据页和/或索引页期间获取对应于由DC接收的每个先前执行的每个操作的每个数据页。

公开(公告)号：US07668961B2

公开(公告)日：2010-02-23

申请号：US10947707

申请日：2004-09-23

Applicant: David Lomet

Inventor： David Lomet

IPC: G06F15/16 ,  G06F11/00

CPC classification number: G06F11/1474 ,  G06F11/1479 ,  H04L69/40

Abstract: The present invention leverages a unilaterally-based interaction contract that enables applications to have a persistent state and ensures an exactly-once execution despite failures between and by communicating entities, permitting disparate software applications to be robustly supported in an environment where little is known about the implementation of the interaction contract. In one instance of the present invention, a web services interaction contract provides a communicating application with duplicate commit request elimination, persistent state transitions, and/or unique persistent reply requests. The present invention permits this interaction contract to be supported by, for example, a persistent application, a workflow, a transaction queue, a database, and a file system to facilitate in providing idempotent executions for requests from a communicating application.

Abstract translation: 本发明利用单方面的交互合同，使得应用能够具有持久状态，并确保即使在通信实体之间发生故障并且通过通信实体发生故障，从而允许不同的软件应用被强有力地支持在一个关于 互动合同的实施。 在本发明的一个实例中，Web服务交互协议为通信应用提供重复的提交请求消除，持久状态转换和/或唯一的持久应答请求。 本发明允许例如持续应用程序，工作流程，事务队列，数据库和文件系统来支持该交互合同，以便于为来自通信应用的请求提供幂等执行。

公开(公告)号：US20070192373A1

公开(公告)日：2007-08-16

申请号：US11354374

申请日：2006-02-15

Applicant: David Lomet

Inventor： David Lomet

IPC: G06F17/30

CPC classification number: G06F11/1471 ,  G06F11/1469

Abstract: Recovery processing of logless components is disclosed. Logless components in middle-tier systems can be checkpointed to provide faster recovery. In particular, a client system, executing a persistent component and itself logging, initiates a snapshot method that returns to the client the values of all variables and other state of the logless component during normal execution. The client writes this data to the client log along with information about the initiation call. To recover the logless component, the client invokes a restore method which takes as an argument values returned from the snapshot method and included in the checkpointing portion of the client log relating to the logless component. This information is sufficient for recreating the logless component which is logically identical to the failed logless component and for setting its state to the checkpoint state. This can occur transparently and shorten the recovery time in providing exactly-once execution.

Abstract translation: 公开了无级元件的恢复处理。 中间层系统中的无逻辑组件可以检查点以提供更快的恢复。 特别地，执行持久组件和自身日志记录的客户端系统启动快照方法，该方法在正常执行期间向客户端返回所有变量的值和无逻辑组件的其他状态。 客户端将该数据连同关于启动呼叫的信息一起写入客户端日志。 要恢复logless组件，客户端将调用恢复方法，该方法将从快照方法返回的参数值作为参数值，并将其包含在与无逻辑组件相关的客户机日志的检查点部分中。 该信息足以重新创建逻辑上与失败的无逻辑组件相同的无逻辑组件，并将其状态设置为检查点状态。 这可以透明地发生，并缩短恢复时间，以提供一次执行。

公开(公告)号：US20050171960A1

公开(公告)日：2005-08-04

申请号：US10768527

申请日：2004-01-30

Applicant: David Lomet

Inventor： David Lomet

IPC: G06F17/00

CPC classification number: G06F17/30327 ,  G06F17/30336 ,  G06F17/30348 ,  Y10S707/99942 ,  Y10S707/99943

Abstract: A data structure, added to a modified form of the Blink-tree data structure, tracks delete states for nodes. The index delete state (DX) indicates whether it is safe to directly access an index node without re-traversing the B-tree. The DX state is maintained globally, outside of the tree structure. The data delete state (DD) indicates whether it is safe to post an index term for a new leaf node. A DD state is maintained in each level 1 node for its leaf nodes. Delete states indicate whether a specific node has not been deleted, or whether it may have been deleted. Delete states are used to remove the necessity for atomic node splits and chains of latches for deletes, while not requiring retraversal. This property of not requiring a retraversal is exploited to simplify the tree modification operations.

Abstract translation: 添加到B ^{链接树数据结构的修改形式的数据结构跟踪节点的删除状态。 索引删除状态（D X）表示在不重新遍历B树的情况下直接访问索引节点是否安全。 在树结构之外，全局地维护D 状态。 数据删除状态（D D ）表示是否可以安全地为新的叶节点发布索引项。 在其叶节点的每个1级节点中保持D D D N状态。 删除状态表示特定节点是否未被删除，或者是否可能被删除。 删除状态用于消除用于删除的原子节点拆分和锁存链的必要性，而不需要重新进行穿越。 利用这种不需要重穿的属性来简化树的修改操作。}

公开(公告)号：US20050114731A1

公开(公告)日：2005-05-26

申请号：US10720622

申请日：2003-11-24

Applicant: David Lomet ,  Roger Barga

Inventor： David Lomet ,  Roger Barga

IPC: G06F11/00

CPC classification number: G06F11/1471 ,  Y10S707/99938 ,  Y10S707/99953

Abstract: A system, method and computer-readable medium for optimizing recovery logging is provided. A calling component stably logs a message from a called component only when sending a second message or sending a second message after a log force that writes the return message from the first message to the stable log. The called component stably logs its return message before the return message is sent.

Abstract translation: 提供了一种用于优化恢复记录的系统，方法和计算机可读介质。 一个呼叫组件只有在发送第二个消息或者在将返回消息从第一个消息写入到稳定日志的日志强制之后发送第二个消息时，才稳定地记录来自被叫组件的消息。 被叫组件在发送返回消息之前稳定地记录其返回消息。