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

1. 发明授权

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

2. 发明申请

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

3. 发明申请

US20100082551A1 DATA PLACEMENT TRANSPARENCY FOR HIGH AVAILABILITY AND LOAD BALANCING 审中-公开
标题翻译：数据放置高可用性和负载平衡的透明度
公开(公告)号：US20100082551A1
公开(公告)日：2010-04-01
申请号：US12238852
申请日：2008-09-26
申请人： Vishal Kathuria , Robert H. Gerber , Mahesh K. Sreenivas , Yixue Zhu , John Ludeman , Ashwin Shrinivas , Ming Chuan Wu
发明人： Vishal Kathuria , Robert H. Gerber , Mahesh K. Sreenivas , Yixue Zhu , John Ludeman , Ashwin Shrinivas , Ming Chuan Wu
IPC分类号： G06F17/30
CPC分类号： G06F16/24524 , G06F16/27
摘要： A method of updating a clone data map associated with a plurality of nodes of a computer system is disclosed. The clone data map includes node identification data and clone location data. A node failure event of a failed node of the computer system that supports a primary clone is detected. The clone data map is updated such that a secondary clone stored at a node other than the failed node is marked as a new primary clone. In addition, clone data maps may be used to perform node load balancing by placing a substantially similar number of primary clones on each node of a node cluster or may be used to increase or decrease a number of nodes of the node cluster. Further, data fragments that have a heavy usage or a large fragment size may be reduced in size by performing one or more data fragment split operations.
摘要翻译：公开了一种更新与计算机系统的多个节点相关联的克隆数据映射的方法。克隆数据图包括节点标识数据和克隆位置数据。检测到支持主克隆的计算机系统的故障节点的节点故障事件。更新克隆数据图，使得存储在除故障节点之外的节点的次级克隆被标记为新的主克隆。此外，克隆数据映射可以用于通过将基本上相似数量的主克隆放置在节点簇的每个节点上来执行节点负载平衡，或者可以用于增加或减少节点簇的多个节点。此外，可以通过执行一个或多个数据片段拆分操作来减小具有较大使用量或大片段大小的数据片段的大小。

4. 发明申请

US20100082546A1 Storage Tiers for Database Server System 审中-公开
标题翻译：数据库服务器系统的存储层
公开(公告)号：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.
摘要翻译：描述了一种用于在多个数据存储设备中存储来自数据库的数据的技术，其中每个数据存储设备仅能够由一组互连的计算机系统中的对应的计算机系统访问。根据该技术，接收数据库的标识符。还接收存储层实例的标识符，其中存储层实例包括每个数据存储设备内的一个或多个存储位置的逻辑表示。响应于接收到数据库的标识符和存储层实例的标识符，来自数据库的数据被存储在由存储层实例逻辑表示的两个或多个存储位置中，其中两个或多个存储位置其中存储数据在相应的一个数据存储设备内。

5. 发明授权

US08131700B2 Transitioning clone data maps and synchronizing with a data query 有权
标题翻译：转换克隆数据映射并与数据查询同步
公开(公告)号：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.
摘要翻译：公开了方法，系统和计算机可读介质，用于响应于节点或媒体故障而不阻止查询来转换克隆和克隆数据访问映射。在系统中，数据请求接口被配置为接收访问存储设备上的数据的查询。数据管理逻辑被配置为访问包括处于静态状态的克隆的多个克隆的克隆状态信息，并且处于暂时状态的克隆。数据管理逻辑还被配置为处理查询以根据动态克隆数据访问映射访问数据，并保持功能正确性。

6. 发明申请

US20100088289A1 TRANSITIONING CLONE DATA MAPS AND SYNCHRONIZING WITH A DATA QUERY 有权
标题翻译：转换克隆数据并与数据查询同步
公开(公告)号：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.
摘要翻译：公开了方法，系统和计算机可读介质，用于响应于节点或媒体故障而不阻止查询来转换克隆和克隆数据访问映射。在系统中，数据请求接口被配置为接收访问存储设备上的数据的查询。数据管理逻辑被配置为访问包括处于静态状态的克隆的多个克隆的克隆状态信息，并且处于暂时状态的克隆。数据管理逻辑还被配置为处理查询以根据动态克隆数据访问映射访问数据，并保持功能正确性。

7. 发明授权

US07590668B2 Pausable backups of file system items 有权
标题翻译：文件系统项目的可靠备份
公开(公告)号：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.
摘要翻译：本发明涉及能够暂停和/或恢复文件系统项目的备份的系统和方法。这些项目根据与每个项目相关联的唯一属性的顺序进行备份。当备份暂停时，存储与暂停之前的最后备份项目相关联的唯一属性。此外，与备份所采用的快照关联的时间戳可以与唯一属性一起存储。恢复后，可以通过利用存储的独特属性从暂停的位置继续备份。可以恢复备份，使用与暂停之前的时间相关联的原始快照或与随后的时间相关的第二快照。本发明可以执行文件系统项目的初始备份和/或这些项目的增量备份。另外，本发明可以支持以不同的粒度级别备份文件系统，例如项目级别。

8. 发明授权

US07814057B2 Page recovery using volume snapshots and logs 有权
标题翻译：使用卷快照和日志进行页面恢复
公开(公告)号：US07814057B2
公开(公告)日：2010-10-12
申请号：US11099021
申请日：2005-04-05
申请人： Vishal Kathuria , Michael J Zwilling , Hanumantha R Kodavalla , Steven R Schmidt , Martin J Sleeman , Rajeev B Rajan , Artem A Oks
发明人： Vishal Kathuria , Michael J Zwilling , Hanumantha R Kodavalla , Steven R Schmidt , Martin J Sleeman , Rajeev B Rajan , Artem A Oks
IPC分类号： G06F7/00
CPC分类号： G06F11/1471 , G06F2201/80 , G06F2201/84
摘要： Systems and methods are disclosed that facilitate providing page-level database restore functionality upon detection of a corruption event. Updates to a data page in a database can trigger generation of a snapshot of the data page, and an update log can be maintained that stores information related to page updates. Subsequent snapshots can be generated at predetermined intervals and can trigger truncation of a log segment and initiation of a new log segment. Upon detection of page corruption, a most-recent uncorrupt snapshot of the corrupt page can be identified, copied to the location of the corrupt page in the database, and modified according to the log segment associated with the uncorrupt snapshot to make the page current as of the corrupting event, all of which can be performed to restore the database without having to take the database offline.
摘要翻译：公开了在检测到腐败事件时便于提供页面级数据库恢复功能的系统和方法。对数据库中的数据页的更新可以触发数据页快照的生成，并且可以维护存储与页面更新相关的信息的更新日志。随后的快照可以以预定的间隔生成并且可以触发日志段的截断和新的日志段的启动。在检测到页面损坏时，可以识别损坏的页面的最新的不破坏的快照，将其复制到数据库中的损坏页面的位置，并根据与非破坏快照关联的日志段进行修改，以使页面当前为的破坏事件，所有这些都可以执行以恢复数据库，而不必使数据库脱机。

9. 发明授权

US07523288B2 Dynamic fragment mapping 有权
标题翻译：动态片段映射
公开(公告)号：US07523288B2
公开(公告)日：2009-04-21
申请号：US11470586
申请日：2006-09-06
申请人： Robert H. Gerber , Vishal Kathuria
发明人： Robert H. Gerber , Vishal Kathuria
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28 , G06F9/26 , G06F9/34 , G06F7/00 , G06F17/30 , G06F17/00
CPC分类号： G06F17/30339 , G06F17/30584 , Y10S707/99937 , Y10S707/99942 , Y10S707/99953
摘要： A dataset is divided into pieces and stored at multiple locations and the system dynamically increases or decreases the number of storage locations where the pieces of the data set may be stored. A data structure comprises a first data field including a first index and a first element, and one or more data fields each with an index and an element. The elements of the one or more data fields include a token representing a location associated with the index of the first data field. A data row of a data set is mapped to the index of a data field using a second index. The second index is derived from a data row of the data set using a hash function. The second index is then mapped to the index of a data field included in the one or more data fields using a modulus function.
摘要翻译：数据集被分成多个位置存储，系统动态地增加或减少存储数据集的存储位置的数量。数据结构包括包括第一索引和第一元素的第一数据字段以及每个具有索引和元素的一个或多个数据字段。一个或多个数据字段的元素包括表示与第一数据字段的索引相关联的位置的令牌。使用第二索引将数据集的数据行映射到数据字段的索引。第二个索引是使用散列函数从数据集的数据行导出的。然后使用模函数将第二索引映射到包含在一个或多个数据字段中的数据字段的索引。

10. 发明授权

US07801866B1 Systems and methods for reading only durably committed data in a system that otherwise permits lazy commit of transactions 有权
标题翻译：在系统中只读取持久地提交的数据的系统和方法，否则允许延迟交易
公开(公告)号：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”允许通过不等待要写入磁盘的事务的日志记录来更快地提交数据库事务。在提交过程中发生系统崩溃时，事务可能会丢失，因为日志数据不可用于重新创建事务。虽然懒惰加速处理，但它们也增加了数据不一致的可能性。本发明介绍了需要与延迟提交事务隔离的“持久读取” - 交易的概念，必须保证只读持久地提交的数据。当持久读取事务尝试读取数据由延迟提交事务更改时，系统将确保延迟提交事务的更改首先变得持久。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式