利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

17 条记录 (耗时 0.034 秒)

    Data change ordering in multi-log based replication
    3.
    发明授权
    Data change ordering in multi-log based replication 有权
    基于多日志的复制中的数据更改排序

    公开(公告)号：US08078582B2

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

    申请号：US12418635

    申请日：2009-04-06

    申请人： Rui Wang ,  Peter Byrne ,  Leigh M. Stewart ,  Robin D. Dhamankar ,  Qun Guo ,  Michael E. Habben ,  Xiaowei Jiang

    发明人： Rui Wang ,  Peter Byrne ,  Leigh M. Stewart ,  Robin D. Dhamankar ,  Qun Guo ,  Michael E. Habben ,  Xiaowei Jiang

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30368

    摘要： Aspects of the subject matter described herein relate to data change ordering in multi-log based replication. In aspects, local seeds are maintained for subtransactions involved in a transaction, where each subtransaction may occur on a different node that hosts one or more database fragments involved in the transaction. When a subtransaction communicates with another subtransaction in a transaction, the subtransaction sends its local seed to the other subtransaction. The receiving subtransaction compares its local seed with the received seed and updates its local seed if the received seed is logically after its local seed. A subtransaction uses a local seed to generate sequence identifiers for changes made by the subtransaction. These identifiers allow data changes of a transaction that are made on multiple nodes to be partially ordered relative to other changes made during the transaction.

    摘要翻译： 本文描述的主题的方面涉及基于多日志的复制中的数据改变排序。 在方面中，维护涉及事务的子事务的局部种子，其中每个子事务可以在承载事务涉及的一个或多个数据库片段的不同节点上发生。 当子事务与事务中的另一个子事务通信时，子事务将其本地种子发送到另一个子事务。 接收的子事务将其本地种子与接收的种子进行比较，如果接收的种子在其本地种子之后是逻辑上的，则更新其本地种子。 子事务使用本地种子为子事务所做的更改生成序列标识符。 这些标识符允许在多个节点上进行的事务的数据更改相对于在事务期间进行的其他更改而被部分排序。

    DATA CHANGE ORDERING IN MULTI-LOG BASED REPLICATION
    4.
    发明申请
    DATA CHANGE ORDERING IN MULTI-LOG BASED REPLICATION 有权
    数据更改在多种方式下进行更新

    公开(公告)号：US20100257138A1

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

    申请号：US12418635

    申请日：2009-04-06

    申请人： Rui Wang ,  Peter Byrne ,  Leigh M. Stewart ,  Robin D. Dhamankar ,  Qun Guo ,  Michael E. Habben ,  Xiaowei Jiang

    发明人： Rui Wang ,  Peter Byrne ,  Leigh M. Stewart ,  Robin D. Dhamankar ,  Qun Guo ,  Michael E. Habben ,  Xiaowei Jiang

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30368

    摘要： Aspects of the subject matter described herein relate to data change ordering in multi-log based replication. In aspects, local seeds are maintained for subtransactions involved in a transaction, where each subtransaction may occur on a different node that hosts one or more database fragments involved in the transaction. When a subtransaction communicates with another subtransaction in a transaction, the subtransaction sends its local seed to the other subtransaction. The receiving subtransaction compares its local seed with the received seed and updates its local seed if the received seed is logically after its local seed. A subtransaction uses a local seed to generate sequence identifiers for changes made by the subtransaction. These identifiers allow data changes of a transaction that are made on multiple nodes to be partially ordered relative to other changes made during the transaction.

    摘要翻译： 本文描述的主题的方面涉及基于多日志的复制中的数据改变排序。 在方面中，维护涉及事务的子事务的局部种子，其中每个子事务可以在承载事务涉及的一个或多个数据库片段的不同节点上发生。 当子事务与事务中的另一个子事务通信时，子事务将其本地种子发送到另一个子事务。 接收的子事务将其本地种子与接收的种子进行比较，如果接收的种子在其本地种子之后是逻辑上的，则更新其本地种子。 子事务使用本地种子为子事务所做的更改生成序列标识符。 这些标识符允许在多个节点上进行的事务的数据更改相对于在事务期间进行的其他更改而被部分排序。

    Lightweight caching of transaction log for sequential access
    5.
    发明授权
    Lightweight caching of transaction log for sequential access 有权
    轻量级缓存事务日志以进行顺序访问

    公开(公告)号：US08612390B2

    公开(公告)日：2013-12-17

    申请号：US13098647

    申请日：2011-05-02

    申请人： Rui Wang ,  Peter Byrne

    发明人： Rui Wang ,  Peter Byrne

    IPC分类号： G06F17/00 ,  G06F7/00

    CPC分类号： G06F17/3048 ,  G06F17/30457

    摘要： Searching cached log blocks. A method includes performing a first search on cached log blocks for a log block having a first log block ID. The log blocks are cached and organized into sequentially ordered log buffers in memory. Adjacent sequentially ordered log buffers are double linked to each other. Each log buffer includes a complete range of log blocks from a starting log block ID to an ending log block ID. As part of the first search one or more links are followed, forward and/or backward, to one or more other log buffers. The method may further include determining that the first log block is not found by following one or more links forward and/or backward to one or more other log buffers and as a result, follow one or more covering pointers to one or more log buffers to search for the first log block.

    摘要翻译： 搜索缓存的日志块。 一种方法包括对具有第一个日志块ID的日志块执行对高速缓存的日志块的第一次搜索。 日志块被缓存并组织成内存中的顺序排序的日志缓冲区。 相邻的顺序排序的日志缓冲区相互双重链接。 每个日志缓冲区包括从起始日志块ID到结束日志块ID的完整范围的日志块。 作为第一次搜索的一部分，一个或多个链接被跟随，向前和/或向后到一个或多个其他日志缓冲器。 该方法还可以包括通过将一个或多个链路向前和/或向后追溯到一个或多个其它日志缓冲区来确定不发现第一日志块，并且因此，遵循一个或多个覆盖指针到一个或多个日志缓冲器 搜索第一个日志块。

    LIGHTWEIGHT CACHING OF TRANSACTION LOG FOR SEQUENTIAL ACCESS
    6.
    发明申请
    LIGHTWEIGHT CACHING OF TRANSACTION LOG FOR SEQUENTIAL ACCESS 有权
    用于顺序访问的轻量级交易记录

    公开(公告)号：US20120284295A1

    公开(公告)日：2012-11-08

    申请号：US13098647

    申请日：2011-05-02

    申请人： Rui Wang ,  Peter Byrne

    发明人： Rui Wang ,  Peter Byrne

    IPC分类号： G06F17/30

    CPC分类号： G06F17/3048 ,  G06F17/30457

    摘要： Searching cached log blocks. A method includes performing a first search on cached log blocks for a log block having a first log block ID. The log blocks are cached and organized into sequentially ordered log buffers in memory. Adjacent sequentially ordered log buffers are double linked to each other. Each log buffer includes a complete range of log blocks from a starting log block ID to an ending log block ID. As part of the first search one or more links are followed, forward and/or backward, to one or more other log buffers. The method may further include determining that the first log block is not found by following one or more links forward and/or backward to one or more other log buffers and as a result, follow one or more covering pointers to one or more log buffers to search for the first log block.

    摘要翻译： 搜索缓存的日志块。 一种方法包括对具有第一个日志块ID的日志块执行对高速缓存的日志块的第一次搜索。 日志块被缓存并组织成内存中的顺序排序的日志缓冲区。 相邻的顺序排序的日志缓冲区相互双重链接。 每个日志缓冲区包括从起始日志块ID到结束日志块ID的完整范围的日志块。 作为第一次搜索的一部分，一个或多个链接被跟随，向前和/或向后到一个或多个其他日志缓冲器。 该方法还可以包括通过将一个或多个链路向前和/或向后追溯到一个或多个其它日志缓冲区来确定不发现第一日志块，并且因此，遵循一个或多个覆盖指针到一个或多个日志缓冲器 搜索第一个日志块。

    Poinsettia plant named ‘PER14606’
    7.
    植物专利
    Poinsettia plant named ‘PER14606’ 有权
    一品红植物名为PER14606

    公开(公告)号：USPP23031P2

    公开(公告)日：2012-09-11

    申请号：US12802242

    申请日：2010-06-01

    申请人： Peter Byrne

    发明人： Peter Byrne

    IPC分类号： A01H5/00

    CPC分类号： A01H6/38 ,  A01H5/02

    摘要： A new and distinct cultivar of Poinsettia plant named ‘PER14606’, characterized by its uniform, upright and mounded plant habit; moderately vigorous growth habit; freely branching habit; green and pale yellow variegated leaves; mid-season flowering response; large inflorescences with red-colored flower bracts; and good post-production longevity.

    摘要翻译： 一品红新品种，名为“PER14606”，其特征是其均匀，直立和堆积的植物习性; 中度生长习惯; 自由分支习惯; 绿色和淡黄色杂色叶; 季节开花响应; 大花序与红色花苞片; 并具有良好的后期制作寿命。

    Techniques for leveraging replication to provide rolling point in time backup with simplified restoration through distributed transactional re-creation
    8.
    发明授权
    Techniques for leveraging replication to provide rolling point in time backup with simplified restoration through distributed transactional re-creation 有权
    利用复制技术提供滚动点的时间备份，并通过分布式事务重新创建进行简化恢复

    公开(公告)号：US08903774B2

    公开(公告)日：2014-12-02

    申请号：US13425876

    申请日：2012-03-21

    申请人： Shuab Khan ,  Peter Byrne ,  Yogesh Bansal ,  Gregory Thiel ,  Ross Smith, IV

    发明人： Shuab Khan ,  Peter Byrne ,  Yogesh Bansal ,  Gregory Thiel ,  Ross Smith, IV

    IPC分类号： G06F17/30 ,  G06F11/14

    CPC分类号： G06F17/30368 ,  G06F11/1461 ,  G06F11/1471 ,  G06F11/2094

    摘要： Techniques to leverage replication to provide rolling point in time backup are described. Some embodiments are directed to techniques to provide rolling point in time backup with simplified restoration through distributed transactional re-creation. In one embodiment, for example, a technique may comprise creating a plurality of availability copies of a primary set of data; designating at least one of the plurality of availability copies as a backup copy; creating a log file that indicates changes to the primary set of data; updating the plurality of availability copies from the log file in near real time, without updating the backup copy; and restoring at least one of: the primary set of data and an availability copy using the backup copy and content resubmitted from a content contributor when an error occurs in at least one of: the primary set of data and an availability copy. Other embodiments are described and claimed.

    摘要翻译： 描述了利用复制提供滚动点的时间备份的技术。 一些实施例涉及通过分布式事务再创建简化恢复来提供时间备份中的滚动点的技术。 在一个实施例中，例如，技术可以包括创建主要数据集合的多个可用性副本; 将所述多个可用性副本中的至少一个指定为备份副本; 创建指示对主要数据集进行更改的日志文件; 从日志文件中实时更新多个可用性副本，而无需更新备份副本; 以及至少一个：当所述主要数据集和可用性副本中的至少一个发生错误时，使用所述备份副本和从所述内容提供者重新提交的内容来恢复所述主要数据集和可用性副本。 描述和要求保护其他实施例。

    DATABASE DATA RECOVERY SYSTEM AND METHOD
    9.
    发明申请
    DATABASE DATA RECOVERY SYSTEM AND METHOD 有权
    数据库数据恢复系统和方法

    公开(公告)号：US20120101997A1

    公开(公告)日：2012-04-26

    申请号：US13339077

    申请日：2011-12-28

    申请人： Michael J. Zwilling ,  Gregory A. Smith ,  Rajeev B. Rajan ,  Jakub Kulesza ,  Peter Byrne ,  Shashikant Brijmohan Khandelwal ,  Mark S. Wistrom

    发明人： Michael J. Zwilling ,  Gregory A. Smith ,  Rajeev B. Rajan ,  Jakub Kulesza ,  Peter Byrne ,  Shashikant Brijmohan Khandelwal ,  Mark S. Wistrom

    IPC分类号： G06F17/30

    CPC分类号： G06F11/2097 ,  G06F11/1451 ,  G06F11/1469 ,  G06F11/1471 ,  G06F2201/80 ,  G06F2201/82 ,  G06F2201/84

    摘要： The present invention relates to a system and method of data restoration, for instance, after the occurrence of a user error. In particular, snapshot database can be maintained that stores a copy of database data. The snapshot database does not have to store a complete copy of all data on a source database, but rather shares data that is common to both but not necessarily identical. If an error occurs on the primary database then the database can be reverted back to a point in time prior to the error by replacing source database files with snapshot files. Additionally, an undo component can be employed in conjunction with the snapshot to approach an error to a finer grained point in time. In brief, the present invention can restore a database much faster and simpler, while utilizing less space and resources than conventional data restoration technologies.

    摘要翻译： 本发明涉及数据恢复的系统和方法，例如在用户错误发生之后。 特别地，可以维护存储数据库数据的副本的快照数据库。 快照数据库不必在源数据库上存储所有数据的完整副本，而是共享两者共同但不一定相同的数据。 如果主数据库发生错误，则数据库可以通过将源数据库文件替换为快照文件来恢复到错误之前的时间点。 另外，一个撤销组件可以与快照一起使用，以将错误接近一个更精细的粒度点。 简而言之，本发明可以比传统的数据恢复技术更少和更少地使用更少的空间和资源来更快速和简单地恢复数据库。