会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • TRANSACTION SUPPORT FOR DISTRIBUTED DATA
    • 分配数据的交易支持
    • US20120179645A1
    • 2012-07-12
    • US12986962
    • 2011-01-07
    • David LometMohamed MokbelJustin LevandoskiKeliang Zhao
    • David LometMohamed MokbelJustin LevandoskiKeliang Zhao
    • G06F17/00
    • 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. 发明授权
    • C-tree for multi-attribute indexing
    • C-tree用于多属性索引
    • US07668845B1
    • 2010-02-23
    • US10891583
    • 2004-07-15
    • David LometBetty Joan Salzberg
    • David LometBetty Joan Salzberg
    • G07F17/00
    • G06F17/30327G06F17/30333Y10S707/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. 发明授权
    • Lazy timestamping in transaction time database
    • 交易时间数据库中的延迟时间戳
    • US07424499B2
    • 2008-09-09
    • US11040598
    • 2005-01-21
    • David Lomet
    • David Lomet
    • G06F17/30
    • G06F17/30353Y10S707/99933Y10S707/99953Y10S707/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. 发明申请
    • Logless persistent components for enterprise applications
    • 用于企业应用程序的无逻辑持久组件
    • US20070016617A1
    • 2007-01-18
    • US11179836
    • 2005-07-12
    • David Lomet
    • David Lomet
    • G06F17/30
    • 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. 发明授权
    • Media recovery with time-split B-trees
    • 媒体恢复与时间分裂B树
    • US5764877A
    • 1998-06-09
    • US530032
    • 1995-09-01
    • David LometBetty Salzberg
    • David LometBetty Salzberg
    • G06F11/14G06F17/30G06F11/00G06F11/34
    • G06F11/1451G06F17/30327G06F17/30359Y10S707/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. 发明申请
    • Wrap-up reads for logless persistent components
    • 对无逻辑持久性组件进行总结读取
    • US20070226705A1
    • 2007-09-27
    • US11354373
    • 2006-02-15
    • David Lomet
    • David Lomet
    • G06F9/44
    • G06F9/466
    • Architecture that facilitates exactly-once application execution via a wrap-up procedure. A logless component (LLcom) processes a last-read activity (or wrap-up read) against external state when processing a method of a middle-tier environment. A client logging component logs results of the method to a client log. The wrap-up procedure of the LLcom is initiated to read external state. External state is read after all GIR requests have been processed but just before the method returns to the client. The LLcom method returns to the client at a point in the caller method that immediately issues the return for the method call. Subsequent client requests become replayable due to the logged results. With client logging, both idempotence of requests and guiding execution back to its original execution path is accomplished. Alternatively, logging can occur via a middle-tier decision service. In either event, the logging enables the middle tier to choose at which back end service it will next send a request will supporting exactly once execution.
    • 通过总结过程促进应用程序执行的体系结构。 无级组件(LLcom)在处理中间层环境的方法时,会处理对外部状态的最后读取活动(或总结读取)。 客户端日志记录组件将方法的结果记录到客户端日志中。 启动LLcom的总结过程以读取外部状态。 所有的GIR请求都被处理完毕,但在方法返回给客户端之前,会读取外部状态。 LLcom方法在调用方法中的一个点返回给客户端,该方法立即发出方法调用的返回值。 由于记录的结果,后续客户端请求变得可重播。 通过客户端日志记录,可以实现请求的同时性和引导执行回到其原始执行路径。 或者,可以通过中间层决策服务进行日志记录。 在任一情况下,日志记录使中间层可以选择下一次发送请求的后端服务,一旦执行就会支持。
    • 7. 发明申请
    • Generalized idempotent requests
    • 广义幂等要求
    • US20070067266A1
    • 2007-03-22
    • US11232397
    • 2005-09-21
    • David Lomet
    • David Lomet
    • G06F17/30
    • G06F17/30864Y10S707/99942Y10S707/99943Y10S707/99944Y10S707/99945
    • A system and methodology that facilitate persistence for an execution state is provided. The system and methodology employ generalized “idempotent” request(s) that have the property they only execute a request once, and always return the result of that first execution should the request be repeated so as to ensure exactly once execution. A calling middle tier component can exploit these procedures so that it can engage in exploratory reads (which are not idempotent) yet still be able to have their state recovered via replay based on the log at the client and the results retained by the generalized idempotent procedures provided by back end services. The system and methodology can be employed to facilitate successful replay of logless persistent component(s), (e.g., components that do not themselves log any information). To exploit generalized idempotent procedures, what a middle tier logless component can do with the results of non-idempotent exploratory reads must be circumscribed so that these results only impact arguments to the next generalized idempotent procedure invoked from the middle tier. Optionally, the system and methodology can facilitate idempotent procedure(s) which support idempotent request abort(s). When an idempotent request abort is requested, it can be identified with the request via a request identifier. Then subsequent request(s) with the same request identifier can return with the same “abort” message.
    • 提供了一种促进执行状态的持久性的系统和方法。 系统和方法使用具有它们只执行一次请求的属性的广义的“幂等”请求,并且如果重复该请求,则总是返回该第一次执行的结果,以便确保一次执行。 一个调用的中间层组件可以利用这些过程,以便它可以进行探索性读取(不是幂等),但是仍然可以根据客户端的日志通过重播来恢复其状态,并且通过广义幂等程序保留结果 由后端服务提供。 可以采用该系统和方法来促成无声持久性组件的成功重播(例如,自身不记录任何信息的组件)。 为了利用广义幂等程序,中间层无逻辑组件可以使用非幂等探查性读取的结果进行限制,因此这些结果只会影响从中间层调用的下一个广义幂等过程的参数。 可选地,系统和方法可以促进支持幂等请求中止的幂等过程。 当请求中止等待请求时,可以通过请求标识符与请求一起识别。 那么具有相同请求标识符的后续请求可以返回相同的“中止”消息。
    • 9. 发明申请
    • Persistent client-server database sessions
    • 持久的客户端 - 服务器数据库会话
    • US20050021514A1
    • 2005-01-27
    • US10920629
    • 2004-08-18
    • Roger BargaDavid Lomet
    • Roger BargaDavid Lomet
    • G06F7/00G06F17/00G06F17/30
    • G06F11/1438G06F11/1471Y10S707/99942Y10S707/99943
    • A client-server database system enables persistent client-server database sessions, without modification to a client-side application, a database system, or native client-side database drivers. The client is implemented with a driver manager to facilitate communication between the native database drivers and the database application. The driver manager wraps the native drivers, intercepting queries passed from the database application to the database drivers. The driver manager modifies the queries to form modified queries that direct the database server to render result sets produced from processing the queries persistent at the database server. Upon recovery following a server crash, the driver manager directs the drivers to reestablish a connection with the database server. The driver manager then finds the persistent result set table and, using logged data, returns to the same operation on the result set table just prior to the crash. The driver manager then reassociates the application context to the new database session without the database application being aware that a failure occurred. The recovery is thus transparent to the client-side application.
    • 客户端 - 服务器数据库系统启用持久的客户端 - 服务器数据库会话,而不会修改客户端应用程序,数据库系统或本机客户端数据库驱动程序。 客户端由驱动程序管理器实现,以促进本机数据库驱动程序与数据库应用程序之间的通信。 驱动程序管理器将本机驱动程序打包,并将从数据库应用程序传递的查询截取到数据库驱动程序。 驱动程序管理器修改查询以形成修改的查询,指导数据库服务器呈现从处理数据库服务器上持久存储的查询生成的结果集。 在服务器崩溃后恢复,驱动程序管理器指示驱动程序重新建立与数据库服务器的连接。 然后,驱动程序管理器会找到持久性结果集表,并使用记录的数据在崩溃之前在结果集表上返回相同的操作。 然后,驱动程序管理器将应用程序上下文重新关联到新数据库会话,而数据库应用程序不知道发生故障。 恢复对客户端应用来说是透明的。
    • 10. 发明授权
    • Transaction support for distributed data
    • 分布式数据的事务支持
    • US08868514B2
    • 2014-10-21
    • US12986962
    • 2011-01-07
    • David LometMohamed MokbelJustin LevandoskiKeliang Zhao
    • David LometMohamed MokbelJustin LevandoskiKeliang Zhao
    • G06F7/00G06F17/00G06F15/16
    • 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.
    • 具有事务支持的分布式系统可以具有事务组件和一个或多个数据组件。 交易组件可以使用每个操作的日志序列号来管理事务,然后将操作发送到具有日志序列号的一个或多个数据组件。 数据组件可以以幂等方式执行数据操作并返回答复。 然后,事务组件可以将操作,其日志序列号和从回复消息的信息写入其日志。 事务组件能够通过使用存储在其日志中的信息来提交事务以及重试或撤销事务的部分。 即使单个事务使用可能位于不同设备上的多个数据组件或管理独立和独立的数据源,这也是可能的。