公开(公告)号：US08671074B2

公开(公告)日：2014-03-11

申请号：US12758045

申请日：2010-04-12

申请人： Rui Wang ,  Michael E. Habben ,  Qun Guo ,  Peter Byrne ,  Robin D. Dhamankar ,  Vishal Kathuria ,  Mahesh K. Sreenivas ,  Yixue Zhu ,  Xiaowei Jiang

发明人： Rui Wang ,  Michael E. Habben ,  Qun Guo ,  Peter Byrne ,  Robin D. Dhamankar ,  Vishal Kathuria ,  Mahesh K. Sreenivas ,  Yixue Zhu ,  Xiaowei Jiang

IPC分类号： G06F17/30

CPC分类号： G06F17/30309 ,  G06F9/466 ,  G06F11/2041 ,  G06F11/2048 ,  G06F11/2097 ,  G06F17/30578 ,  G06F2201/80 ,  G06F2201/82

摘要： Architecture that addresses an end-to-end solution for logical transactional replication from a shared-nothing clustered database management system, which uses adaptive cloning for high availability. This can be time based using a global logical timestamp. The disclosed architecture, used for refreshing stale clones, does not preserve user transaction boundaries, which is a more complex situation than where the boundaries are preserved. In such a scenario it is probable that for a given data segment no clone of the segment may contain the complete user transaction history, and hence, the history has to be pieced together from the logs of multiple different clones. This is accomplished such that log harvesting is coordinated with the clone state transitions to ensure the correctness of logical replication.

摘要翻译： 架构解决了从无共享群集数据库管理系统进行逻辑事务复制的端到端解决方案，该系统使用自适应克隆实现高可用性。 这可以使用全局逻辑时间戳记基于时间。 用于刷新陈旧的克隆的公开架构不会保留用户事务边界，这比保留边界的情况更复杂。 在这种情况下，对于给定的数据段，很可能没有段的克隆可能包含完整的用户事务历史，因此，历史必须从多个不同克隆的日志拼接在一起。 这样做是为了使日志收集与克隆状态转换协调，以确保逻辑复制的正确性。

公开(公告)号：US07590668B2

公开(公告)日：2009-09-15

申请号：US11106838

申请日：2005-04-15

申请人： Vishal Kathuria ,  Martin J. Sleeman ,  Robin Dhananjay Dhamankar ,  Hanumantha Rao Kodavalla

发明人： Vishal Kathuria ,  Martin J. Sleeman ,  Robin Dhananjay Dhamankar ,  Hanumantha Rao Kodavalla

IPC分类号： G06F12/00

CPC分类号： G06F11/1461 ,  G06F2201/84 ,  Y10S707/99953

摘要： The subject invention relates to systems and methods that enable pausing and/or resuming a backup of file system items. The items are backed up in an order based on a unique property associated with each of the items. When the backup is paused, the unique property associated with a last backed up item prior to the pause is stored. Additionally, a timestamp associated with a snapshot from which the backup was taken can be stored with the unique property. Upon being resumed, the backup can continue from the paused location via utilizing the stored unique property. The backup can be resumed either employing an original snapshot associated with a time prior to the pause or a second snapshot related to a subsequent time. The subject invention can perform an initial backup of file system items and/or an incremental backup of such items. Additionally, the subject invention can support backing up a file system at disparate levels of granularity such as, for example, an item level.

摘要翻译： 本发明涉及能够暂停和/或恢复文件系统项目的备份的系统和方法。 这些项目根据与每个项目相关联的唯一属性的顺序进行备份。 当备份暂停时，存储与暂停之前的最后备份项目相关联的唯一属性。 此外，与备份所采用的快照关联的时间戳可以与唯一属性一起存储。 恢复后，可以通过利用存储的独特属性从暂停的位置继续备份。 可以恢复备份，使用与暂停之前的时间相关联的原始快照或与随后的时间相关的第二快照。 本发明可以执行文件系统项目的初始备份和/或这些项目的增量备份。 另外，本发明可以支持以不同的粒度级别备份文件系统，例如项目级别。

公开(公告)号：US07801866B1

公开(公告)日：2010-09-21

申请号：US10782988

申请日：2004-02-20

申请人： Vishal Kathuria ,  Hanumantha Kodavalla ,  Michael J. Zwilling

发明人： Vishal Kathuria ,  Hanumantha Kodavalla ,  Michael J. Zwilling

IPC分类号： G06F17/30

CPC分类号： G06F17/30348 ,  G06F11/1471 ,  G06F17/30368 ,  G06F17/30377

摘要： A “lazy commit” allows database transactions to be committed faster by not waiting for log records of the transaction to be written to disk. When a system crash occurs during the commit process, transactions may be lost because the log data is not available to recreate the transaction. While lazy commits speed up processing, they also increase the potential for data inconsistency. This invention introduces the concept of “durable reads”—transactions that require isolation from lazy commit transactions and which must be guaranteed to read only durably committed data. When durable read transaction attempts to read data changed by a lazy commit transaction, the system ensures the lazy commit transaction's changes are first made durable.

摘要翻译： “lazy commit”允许通过不等待要写入磁盘的事务的日志记录来更快地提交数据库事务。 在提交过程中发生系统崩溃时，事务可能会丢失，因为日志数据不可用于重新创建事务。 虽然懒惰加速处理，但它们也增加了数据不一致的可能性。 本发明介绍了需要与延迟提交事务隔离的“持久读取” - 交易的概念，必须保证只读持久地提交的数据。 当持久读取事务尝试读取数据由延迟提交事务更改时，系统将确保延迟提交事务的更改首先变得持久。

公开(公告)号：US07765361B2

公开(公告)日：2010-07-27

申请号：US11562053

申请日：2006-11-21

申请人： Robin Dhananjay Dhamankar ,  Vishal Kathuria ,  Sethu Kalavakur ,  Gayathri Venkataraman ,  Avraham Levy ,  Hanumantha Rao Kodavalla ,  Chunjia Li ,  Eric Ray Christensen

发明人： Robin Dhananjay Dhamankar ,  Vishal Kathuria ,  Sethu Kalavakur ,  Gayathri Venkataraman ,  Avraham Levy ,  Hanumantha Rao Kodavalla ,  Chunjia Li ,  Eric Ray Christensen

IPC分类号： G06F12/16

CPC分类号： G06F12/0804 ,  G06F11/1471 ,  G06F12/0866 ,  G06F17/30368

摘要： To ensure that logs representative of data changes are durably written, localized storage media cache is flushed to force a write to stable storage. Log sequence number tracking is leveraged to determine if log data in a localized storage media cache is likely to have not been written to durable storage. When this condition is likely, a FLUSH_CACHE command is issued to a storage media controller to force a durable write. This allows recovery of data changes to a transactional system even when its associated storage media does not provide write-ordering guarantees. Moreover, flushing of the storage media cache can be accomplished at a frequency that provides an upper bound on a maximum time between a transaction commit and data being made durable.

摘要翻译： 为了确保代表数据更改的日志持久写入，本地化存储介质缓存被刷新以强制写入稳定的存储。 利用日志序列号跟踪来确定本地化存储介质缓存中的日志数据是否可能尚未写入持久存储。 当这种情况很可能时，会向存储介质控制器发出FLUSH_CACHE命令以强制持久写入。 即使在关联的存储介质不提供写入顺序保证的情况下，也可以将数据更改恢复到事务性系统。 此外，存储介质缓存的刷新可以以提供交易提交和数据被持久的最大时间之间的上限的频率来实现。

公开(公告)号：US20100082546A1

公开(公告)日：2010-04-01

申请号：US12241912

申请日：2008-09-30

申请人： Mahesh K. Sreenivas ,  Robert H. Gerber ,  Vishal Kathuria ,  John F. Ludeman ,  Ashwin Shrinivas ,  Michael A. Uhlar

发明人： Mahesh K. Sreenivas ,  Robert H. Gerber ,  Vishal Kathuria ,  John F. Ludeman ,  Ashwin Shrinivas ,  Michael A. Uhlar

IPC分类号： G06F17/30

CPC分类号： G06F16/221

摘要： A technique is described for storing data from a database across a plurality of data storage devices, wherein each data storage device is capable of being accessed only by a corresponding computer system in a group of interconnected computer systems. In accordance with the technique, an identifier of the database is received. An identifier of a storage tier instance is also received, wherein the storage tier instance comprises a logical representation of one or more storage locations within each of the data storage devices. Responsive to the receipt of the identifier of the database and the identifier of the storage tier instance, data from the database is stored in two or more of the storage locations logically represented by the storage tier instance, wherein each of the two or more storage locations in which data is stored is within a corresponding one of the data storage devices.

摘要翻译： 描述了一种用于在多个数据存储设备中存储来自数据库的数据的技术，其中每个数据存储设备仅能够由一组互连的计算机系统中的对应的计算机系统访问。 根据该技术，接收数据库的标识符。 还接收存储层实例的标识符，其中存储层实例包括每个数据存储设备内的一个或多个存储位置的逻辑表示。 响应于接收到数据库的标识符和存储层实例的标识符，来自数据库的数据被存储在由存储层实例逻辑表示的两个或多个存储位置中，其中两个或多个存储位置 其中存储数据在相应的一个数据存储设备内。

公开(公告)号：US20060190469A1

公开(公告)日：2006-08-24

申请号：US11121284

申请日：2005-05-03

申请人： Vishal Kathuria ,  Hanumantha Kodavalla ,  Martin Sleeman ,  Robin Dhamankar

发明人： Vishal Kathuria ,  Hanumantha Kodavalla ,  Martin Sleeman ,  Robin Dhamankar

IPC分类号： G06F7/00

CPC分类号： G06F9/4493 ,  G06F11/1448 ,  Y10S707/99942

摘要： A system and method for serialization and/or de-serialization of file system item(s) and associated entity(ies)is provided. A file system “item” comprises a core class which can include property(ies). An item can be simple or compound (e.g., includes other item(s) embedded in it). Associated with an item can be entity(ies) such as fragment(s), link(s) with other item(s) and/or extension(s). Through serialization, a consistent copy of the item and associated entity(ies), if any, can be captured (e.g., for transporting of the item and to reconstruct the item on a destination system). The serialization system includes an identification component that. identities entity(ies) associated with an item and a serialization component that serializes the item and associated entity(ies). The serialization component can further serialize a header that includes information associated with the item and associated entity(ies). The header can facilitate random access to the item and associated entity(ies) (e.g., allowing a reader to interpret/parse only the parts in which it is interested). The serialization system can expose application program interface(s) (API's) that facilitate the copying, moving and/or transfer of an item and its associated entity(ies) from one location to another location.

摘要翻译： 提供了一种用于文件系统项目和关联实体的序列化和/或解串行化的系统和方法。 文件系统“项目”包括可以包括属性的核心类。 项目可以是简单的或复合的（例如，包括其中嵌入的其他项目）。 与项目相关联可以是诸如片段，链接与其他项目和/或扩展之类的实体。 通过序列化，可以捕获项目和关联实体（如果有的话）的一致的副本（例如，用于传送物品并在目的地系统上重建物品）。 序列化系统包括识别组件。 与项目相关联的身份实体（entity）和序列化组件（序列化项目和关联实体）的序列化组件。 序列化组件可以进一步序列化包括与项目和关联实体相关联的信息的报头。 标题可以促进对项目和相关实体的随机访问（例如，允许读者仅解释/解析其感兴趣的部分）。 序列化系统可以公开应用程序接口（API），其便于将项目及其相关联的实体从一个位置复制，移动和/或传送到另一个位置。

公开(公告)号：US08131700B2

公开(公告)日：2012-03-06

申请号：US12237895

申请日：2008-09-25

申请人： Yixue Zhu ,  Robert H. Gerber ,  Vishal Kathuria ,  Samuel Hyrum Smith

发明人： Yixue Zhu ,  Robert H. Gerber ,  Vishal Kathuria ,  Samuel Hyrum Smith

IPC分类号： G06F17/30

CPC分类号： G06F17/30575 ,  G06F17/30362

摘要： Methods, systems, and computer-readable media are disclosed for transitioning clones and clone data access maps in response to node or media failure without blocking queries. In a system, a data request interface is configured to receive a query to access data at a storage device. Data management logic is configured to access clone state information of a plurality of clones including clones in a static state and clones in a transitory state. The data management logic is further configured to process the query to access the data according to the dynamic clone data access map, with functional correctness maintained.

摘要翻译： 公开了方法，系统和计算机可读介质，用于响应于节点或媒体故障而不阻止查询来转换克隆和克隆数据访问映射。 在系统中，数据请求接口被配置为接收访问存储设备上的数据的查询。 数据管理逻辑被配置为访问包括处于静态状态的克隆的多个克隆的克隆状态信息，并且处于暂时状态的克隆。 数据管理逻辑还被配置为处理查询以根据动态克隆数据访问映射访问数据，并保持功能正确性。

公开(公告)号：US20110251997A1

公开(公告)日：2011-10-13

申请号：US12758045

申请日：2010-04-12

申请人： Rui Wang ,  Michael E. Habben ,  Qun Guo ,  Peter Byrne ,  Robin D. Dhamankar ,  Vishal Kathuria ,  Mahesh K. Sreenivas ,  Yixue Zhu ,  Xiaowei Jiang

发明人： Rui Wang ,  Michael E. Habben ,  Qun Guo ,  Peter Byrne ,  Robin D. Dhamankar ,  Vishal Kathuria ,  Mahesh K. Sreenivas ,  Yixue Zhu ,  Xiaowei Jiang

IPC分类号： G06F17/30

CPC分类号： G06F17/30309 ,  G06F9/466 ,  G06F11/2041 ,  G06F11/2048 ,  G06F11/2097 ,  G06F17/30578 ,  G06F2201/80 ,  G06F2201/82

摘要： Architecture that addresses an end-to-end solution for logical transactional replication from a shared-nothing clustered database management system, which uses adaptive cloning for high availability. This can be time based using a global logical timestamp. The disclosed architecture, used for refreshing stale clones, does not preserve user transaction boundaries, which is a more complex situation than where the boundaries are preserved. In such a scenario it is probable that for a given data segment no clone of the segment may contain the complete user transaction history, and hence, the history has to be pieced together from the logs of multiple different clones. This is accomplished such that log harvesting is coordinated with the clone state transitions to ensure the correctness of logical replication.

摘要翻译： 架构解决了从无共享群集数据库管理系统进行逻辑事务复制的端到端解决方案，该系统使用自适应克隆实现高可用性。 这可以使用全局逻辑时间戳记基于时间。 用于刷新陈旧的克隆的公开架构不会保留用户事务边界，这比保留边界的情况更复杂。 在这种情况下，对于给定的数据段，很可能没有段的克隆可能包含完整的用户事务历史，因此，历史必须从多个不同克隆的日志拼接在一起。 这样做是为了使日志收集与克隆状态转换协调，以确保逻辑复制的正确性。

公开(公告)号：US20100088289A1

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

申请号：US12237895

申请日：2008-09-25

申请人： Yixue Zhu ,  Robert H. Gerber ,  Vishal Kathuria ,  Samuel Hyrum Smith

发明人： Yixue Zhu ,  Robert H. Gerber ,  Vishal Kathuria ,  Samuel Hyrum Smith

IPC分类号： G06F17/30

CPC分类号： G06F17/30575 ,  G06F17/30362

摘要： Methods, systems, and computer-readable media are disclosed for transitioning clones and clone data access maps in response to node or media failure without blocking queries. In a system, a data request interface is configured to receive a query to access data at a storage device. Data management logic is configured to access clone state information of a plurality of clones including clones in a static state and clones in a transitory state. The data management logic is further configured to process the query to access the data according to the dynamic clone data access map, with functional correctness maintained.

摘要翻译： 公开了方法，系统和计算机可读介质，用于响应于节点或媒体故障而不阻止查询来转换克隆和克隆数据访问映射。 在系统中，数据请求接口被配置为接收访问存储设备上的数据的查询。 数据管理逻辑被配置为访问包括处于静态状态的克隆的多个克隆的克隆状态信息，并且处于暂时状态的克隆。 数据管理逻辑还被配置为处理查询以根据动态克隆数据访问映射访问数据，并保持功能正确性。

公开(公告)号：US20080120470A1

公开(公告)日：2008-05-22

申请号：US11562053

申请日：2006-11-21

申请人： Robin Dhananjay Dhamankar ,  Vishal Kathuria ,  Sethu Kalavakur ,  Gayathri Venkataraman ,  Avraham Levy ,  Hanumantha Rao Kodavalla ,  Chunjia Li ,  Eric Ray Christensen

发明人： Robin Dhananjay Dhamankar ,  Vishal Kathuria ,  Sethu Kalavakur ,  Gayathri Venkataraman ,  Avraham Levy ,  Hanumantha Rao Kodavalla ,  Chunjia Li ,  Eric Ray Christensen

IPC分类号： G06F12/08

CPC分类号： G06F12/0804 ,  G06F11/1471 ,  G06F12/0866 ,  G06F17/30368

摘要： To ensure that logs representative of data changes are durably written, localized storage media cache is flushed to force a write to stable storage. Log sequence number tracking is leveraged to determine if log data in a localized storage media cache is likely to have not been written to durable storage. When this condition is likely, a FLUSH_CACHE command is issued to a storage media controller to force a durable write. This allows recovery of data changes to a transactional system even when its associated storage media does not provide write-ordering guarantees. Moreover, flushing of the storage media cache can be accomplished at a frequency that provides an upper bound on a maximum time between a transaction commit and data being made durable.

摘要翻译： 为了确保代表数据更改的日志持久写入，本地化存储介质缓存被刷新以强制写入稳定的存储。 利用日志序列号跟踪来确定本地化存储介质缓存中的日志数据是否可能尚未写入持久存储。 当这种情况很可能时，会向存储介质控制器发出FLUSH_CACHE命令以强制持久写入。 即使在关联的存储介质不提供写入顺序保证的情况下，也可以将数据更改恢复到事务性系统。 此外，存储介质缓存的刷新可以以提供交易提交和数据被持久的最大时间之间的上限的频率来实现。