专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20120179645A1 TRANSACTION SUPPORT FOR DISTRIBUTED DATA 有权
标题翻译：分配数据的交易支持
公开(公告)号：US20120179645A1
公开(公告)日：2012-07-12
申请号：US12986962
申请日：2011-01-07
申请人： David Lomet , Mohamed Mokbel , Justin Levandoski , Keliang Zhao
发明人： David Lomet , Mohamed Mokbel , Justin Levandoski , Keliang Zhao
IPC分类号： G06F17/00
CPC分类号： G06F17/30575
摘要： 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.
摘要翻译：具有事务支持的分布式系统可以具有事务组件和一个或多个数据组件。交易组件可以使用每个操作的日志序列号来管理事务，然后将操作发送到具有日志序列号的一个或多个数据组件。数据组件可以以幂等方式执行数据操作并返回答复。然后，事务组件可以将操作，其日志序列号和从回复消息的信息写入其日志。事务组件能够通过使用存储在其日志中的信息来提交事务以及重试或撤销事务的部分。即使单个事务使用可能位于不同设备上的多个数据组件或管理独立和独立的数据源，这也是可能的。

2. 发明授权

US07668845B1 C-tree for multi-attribute indexing 失效
标题翻译： C-tree用于多属性索引
公开(公告)号：US07668845B1
公开(公告)日：2010-02-23
申请号：US10891583
申请日：2004-07-15
申请人： David Lomet , Betty Joan Salzberg
发明人： David Lomet , Betty Joan Salzberg
IPC分类号： G07F17/00
CPC分类号： G06F17/30327 , G06F17/30333 , Y10S707/99942
摘要： An abstract indexing structure called a C-tree that it is an access method that exploits search space “containment” is described. The C-tree structure includes objects spaces that overlap, but search spaces that are disjoint. Every part of the search space is indexed by some node. Moreover, every object has a unique location in the index, despite the object space overlap. The C-tree is a tree of pages, typically disk based, like a B-tree, but it handles a greater variety of data, e.g., spatial data, temporal data, etc. In particular, it can handle the indexing of objects that have extents, not merely point data, and hence objects that can overlap. These objects can be indexed without remapping them to a higher dimensional point space. At least one particular aspect of the invention is premised on a notion of an object being contained in some kind of search space.
摘要翻译：描述了一种称为C-tree的抽象索引结构，它是一种利用搜索空间“遏制”的访问方法。 C树结构包括重叠的对象空间，但是不相交的搜索空间。搜索空间的每一部分由某个节点索引。此外，尽管对象空间重叠，但每个对象在索引中都具有唯一的位置。 C树是一棵树，通常是基于磁盘的B树，但它处理更多种类的数据，例如空间数据，时间数据等。特别地，它可以处理对象的索引具有范围，而不仅仅是点数据，因此可以重叠的对象。可以对这些对象进行索引，而不将其重新映射到更高维度的点空间。本发明的至少一个特定方面的前提是物体被包含在某种搜索空间中的概念。

3. 发明授权

US07424499B2 Lazy timestamping in transaction time database 有权
标题翻译：交易时间数据库中的延迟时间戳
公开(公告)号：US07424499B2
公开(公告)日：2008-09-09
申请号：US11040598
申请日：2005-01-21
申请人： David Lomet
发明人： David Lomet
IPC分类号： G06F17/30
CPC分类号： G06F17/30353 , Y10S707/99933 , Y10S707/99953 , Y10S707/99957
摘要： Lazy timestamping in a transaction time database is performed using volatile reference counting and checkpointing. Volatile reference counting is employed to provide a low cost way of garbage collecting persistent timestamp information about a transaction by identifying exactly when all record versions of a transaction are timestamped and the versions are persistent. A volatile timestamp (VTS) table is created in a volatile memory, and stores timestamp, reference count, transaction ID, and LSN information. Active portions of a persisted timestamp (PTS) table are stored in the VTS table to provide faster and more efficient timestamp processing via accesses to the VTS table information. The reference count information is stored only in the VTS table for faster access. When the reference count information decrements to zero, it is known that all record versions that were updates for a transaction were timestamped. A checkpointing component facilitates checkpoint processing for verifying that timestamped records have been written to the persistent database and that garbage collection of the PTS table can be performed for transaction entries with zero reference counts.
摘要翻译：使用易失性引用计数和检查点执行事务处理时间数据库中的延迟时间戳。使用易失性引用计数来提供一种低成本的垃圾收集关于交易的持续时间戳信息的方式，通过确定事务的所有记录版本是否具有时间戳并且版本是持久的。在易失性存储器中创建易失性时间戳（VTS）表，并存储时间戳记，引用计数，事务ID和LSN信息。持久时间戳（PTS）表的活动部分存储在VTS表中，以通过访问VTS表信息来提供更快更有效的时间戳处理。参考计数信息仅存储在VTS表中，以便更快的访问。当引用计数信息递减到零时，已知所有作为事务更新的记录版本都是时间戳的。检查点组件有助于检查点处理，以验证时间戳记已被写入持久数据库，并且可以对具有零引用计数的事务条目执行PTS表的垃圾回收。

4. 发明申请

US20070016617A1 Logless persistent components for enterprise applications 有权
标题翻译：用于企业应用程序的无逻辑持久组件
公开(公告)号：US20070016617A1
公开(公告)日：2007-01-18
申请号：US11179836
申请日：2005-07-12
申请人： David Lomet
发明人： David Lomet
IPC分类号： G06F17/30
CPC分类号： G06F11/1482
摘要： Systems and methods that create persistence for an execution state via employing a logless component with persistent stateful functionality. The logless component is introduced as part of a runtime service that supplies transparent state persistence and automatic recovery for component based applications. Such logless component can avoid logging at a middle tier, and exploit logging that is already performed at a client side and/or various end point servers. The execution state can be re-created entirely via replay of the component execution, without the need to replicate the execution state or save the component's interactions in the middle tier.
摘要翻译：通过采用具有持久状态功能的无限制组件，为执行状态创建持久性的系统和方法。无逻辑组件作为运行时服务的一部分引入，它为基于组件的应用程序提供透明状态持久性和自动恢复。这种无逻辑组件可以避免在中间层进行日志记录，并利用已经在客户端和/或各种端点服务器上执行的日志记录。执行状态可以通过重播组件执行完全重新创建，而无需复制执行状态或将组件的交互保存在中间层。

5. 发明授权

US5764877A Media recovery with time-split B-trees 失效
标题翻译：媒体恢复与时间分裂B树
公开(公告)号：US5764877A
公开(公告)日：1998-06-09
申请号：US530032
申请日：1995-09-01
申请人： David Lomet , Betty Salzberg
发明人： David Lomet , Betty Salzberg
IPC分类号： G06F11/14 , G06F17/30 , G06F11/00 , G06F11/34
CPC分类号： G06F11/1451 , G06F17/30327 , G06F17/30359 , Y10S707/99933
摘要： Modern database systems provide media recovery by taking periodic backups and applying a transaction log to the backup to bring the data up-to-date. A multi-versioned database is one that retains and provides access to historical versions of data. The present invention shows how a history database, supported by the Time-Split B-tree, can be used to also provide the backup function of media recovery. Thus, the same versions used for database history are used for database backup. The cost of taking a backup is comparable to the cost of a good differential backup method, whereby only changed data is backed up. The media recovery cost, especially when the media failure is only partial, e.g., a single disk page, will frequently be lower.
摘要翻译：现代数据库系统通过定期备份并将事务日志应用到备份来提供数据更新，从而提供媒体恢复。多版本数据库是保留并提供对历史版本数据的访问的数据库。本发明示出了如何使用由时间分割B树支持的历史数据库也可以提供媒体恢复的备份功能。因此，用于数据库历史记录的相同版本用于数据库备份。备份的成本与良好差异备份方法的成本相当，只有备份更改后的数据。媒体恢复成本，特别是当介质故障仅仅是部分的（例如，单个磁盘页面）时，会经常降低。

6. 发明授权

US08868514B2 Transaction support for distributed data 有权
标题翻译：分布式数据的事务支持
公开(公告)号：US08868514B2
公开(公告)日：2014-10-21
申请号：US12986962
申请日：2011-01-07
申请人： David Lomet , Mohamed Mokbel , Justin Levandoski , Keliang Zhao
发明人： David Lomet , Mohamed Mokbel , Justin Levandoski , Keliang Zhao
IPC分类号： G06F7/00 , G06F17/00 , G06F15/16
CPC分类号： G06F17/30575
摘要： 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.
摘要翻译：具有事务支持的分布式系统可以具有事务组件和一个或多个数据组件。交易组件可以使用每个操作的日志序列号来管理事务，然后将操作发送到具有日志序列号的一个或多个数据组件。数据组件可以以幂等方式执行数据操作并返回答复。然后，事务组件可以将操作，其日志序列号和从回复消息的信息写入其日志。事务组件能够通过使用存储在其日志中的信息来提交事务以及重试或撤销事务的部分。即使单个事务使用可能位于不同设备上的多个数据组件或管理独立和独立的数据源，这也是可能的。

7. 发明申请

US20120005168A1 Logical Recovery with Unbundled Transaction Services 有权
标题翻译：使用非捆绑交易服务进行逻辑恢复
公开(公告)号：US20120005168A1
公开(公告)日：2012-01-05
申请号：US12827941
申请日：2010-06-30
申请人： David Lomet , Kostas Tzoumas
发明人： David Lomet , Kostas Tzoumas
IPC分类号： G06F17/30
CPC分类号： G06F11/1471
摘要： 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
摘要翻译：该专利申请涉及用于具有非捆绑存储引擎的系统的重做恢复操作的增强的逻辑恢复技术。这些技术可以通过利用增强的逻辑恢复方法来实现，其中基于在正常执行期间记录的信息来构造脏页表（DPT）。非捆绑存储引擎可以包括在架构上独立于数据组件（DC）的事务组件（TC）。这些技术可以通过减轻确定从TC发送到DC的先前执行的操作是否要响应于恢复发起事件而重复所需的资源来增强重做恢复操作。这可以包括使用DPT来避免在恢复期间和/或预取数据页和/或与DPT中的PID相对应的索引页时获取对应于由DC接收的每个先前执行的每个操作的每个数据页

8. 发明申请

US20060090095A1 Consistent cluster operational data in a server cluster using a quorum of replicas 有权
标题翻译：服务器集群中使用复制数量的一致的集群操作数据
公开(公告)号：US20060090095A1
公开(公告)日：2006-04-27
申请号：US11225222
申请日：2005-09-12
申请人： Michael Massa , David Dion , Rajsekhar Das , Rushabh Doshi , David Lomet , Gor Nishanov , Philip Bernstein , Rod Gamache , Rohit Jain , Sunita Shrivastava
发明人： Michael Massa , David Dion , Rajsekhar Das , Rushabh Doshi , David Lomet , Gor Nishanov , Philip Bernstein , Rod Gamache , Rohit Jain , Sunita Shrivastava
IPC分类号： G06F11/00
CPC分类号： G06F17/30575 , G06F11/1425 , G06F11/1471 , G06F11/1479 , G06F11/1482 , G06F11/1662 , G06F11/181 , G06F11/182 , G06F11/2023 , G06F11/2035 , G06F11/2058 , G06F2201/82
摘要： 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.
摘要翻译：通过至少要求一个节点和副本成员的仲裁复制集来形成和操作集群，来提高服务器集群可用性的方法和系统。副本成员维护集群操作数据。当一个节点拥有大多数副本成员时，集群就会运行，从而确保任何新的或存活的集群通过至少一个来自紧接在前的集群的副本成员包括一致的集群操作数据。仲裁提供复制成员的一个节点的独占所有权，包括在集群形成时以及所有节点出现故障时。仲裁使用快速互斥算法和保留机制来挑战和保护每个成员的独家保留。仲裁复制集算法使成员在线和离线具有数据一致性，包括更新未协调的副本成员，并确保一致的读取和更新操作。

9. 发明申请

US20060080670A1 Unilateral web services interaction contract 有权
标题翻译：单边Web服务交互合同
公开(公告)号：US20060080670A1
公开(公告)日：2006-04-13
申请号：US10947707
申请日：2004-09-23
申请人： David Lomet
发明人： David Lomet
IPC分类号： G06F9/44
CPC分类号： G06F11/1474 , G06F11/1479 , H04L69/40
摘要： 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.
摘要翻译：本发明利用单方面的交互合同，使得应用能够具有持久状态，并确保即使在通信实体之间发生故障并且通过通信实体发生故障，从而允许不同的软件应用被强有力地支持在一个关于互动合同的实施。在本发明的一个实例中，Web服务交互协议为通信应用提供重复的提交请求消除，持久状态转换和/或唯一的持久应答请求。本发明允许例如持续应用程序，工作流程，事务队列，数据库和文件系统来支持该交互合同，以便于为来自通信应用的请求提供幂等执行。

10. 发明申请

US20050066217A1 Persistent stateful component-based applications via automatic recovery 失效
标题翻译：通过自动恢复持久状态的基于组件的应用程序
公开(公告)号：US20050066217A1
公开(公告)日：2005-03-24
申请号：US10977709
申请日：2004-10-29
申请人： Roger Barga , David Lomet
发明人： Roger Barga , David Lomet
IPC分类号： G06F11/00 , G06F11/14 , H02H3/05
CPC分类号： G06F11/1482 , G06F11/1438 , G06F11/1471
摘要： 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.
摘要翻译：在进程和服务器故障之间提供持久组件，而不需要应用程序员采取措施来实现组件可恢复性。与状态组件的应用程序交互被透明地拦截并稳定地记录到持久存储器中。 “虚拟”组件将应用程序与组件故障隔离，允许将组件映射到任意“物理”组件。从应用程序检测并屏蔽组件故障。一个虚拟组件被重新映射到一个新的物理组件，重新创建组件并重新安装状态直到上次记录的交互操作所需的操作将从日志自动重播。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式