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

1. 发明授权

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

2. 发明申请

US20130198141A1 TECHNIQUES FOR LEVERAGING REPLICATION TO PROVIDE ROLLING POINT IN TIME BACKUP WITH SIMPLIFIED RESTORATION THROUGH DISTRIBUTED TRANSACTIONAL RE-CREATION 有权
标题翻译：用于通过分布式交易重新进行简化恢复的时间备份来提取回滚点的技术
公开(公告)号：US20130198141A1
公开(公告)日：2013-08-01
申请号：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分类号： G06F7/00 , G06F17/30
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.
摘要翻译：描述了利用复制提供滚动点的时间备份的技术。一些实施例涉及通过分布式事务再创建简化恢复来提供时间备份中的滚动点的技术。在一个实施例中，例如，技术可以包括创建主要数据集合的多个可用性副本; 将所述多个可用性副本中的至少一个指定为备份副本; 创建指示对主要数据集进行更改的日志文件; 从日志文件中实时更新多个可用性副本，而无需更新备份副本; 以及至少一个：当所述主要数据集和可用性副本中的至少一个发生错误时，使用所述备份副本和从所述内容提供者重新提交的内容来恢复所述主要数据集和可用性副本。描述和要求保护其他实施例。

3. 发明申请

US20120284295A1 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的完整范围的日志块。作为第一次搜索的一部分，一个或多个链接被跟随，向前和/或向后到一个或多个其他日志缓冲器。该方法还可以包括通过将一个或多个链路向前和/或向后追溯到一个或多个其它日志缓冲区来确定不发现第一日志块，并且因此，遵循一个或多个覆盖指针到一个或多个日志缓冲器搜索第一个日志块。

4. 发明申请

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

5. 发明授权

US5851524A Human monoclonal anti-rhesus (D) antibodies and cell lines producing same 失效
标题翻译：人单克隆抗体（D）抗体和产生相同的细胞系
公开(公告)号：US5851524A
公开(公告)日：1998-12-22
申请号：US798444
申请日：1997-02-10
申请人： Roland Beliard , Ulf Bethke , Dominique Bourel , Ahmed Bouzidi , Herve Broly , Peter Byrne , Magali Holuigue , Michael Kloft , Detlef Rohm
发明人： Roland Beliard , Ulf Bethke , Dominique Bourel , Ahmed Bouzidi , Herve Broly , Peter Byrne , Magali Holuigue , Michael Kloft , Detlef Rohm
IPC分类号： A61K38/00 , C07K16/34 , C12N5/28 , C12P21/08 , A61K39/395 , C07K16/00 , C12N5/00
CPC分类号： C07K16/34 , A61K38/00 , C07K2317/732
摘要： The invention relates to 2 human monoclonal antibodies of sub-classes IgG1 and IgG3, against the Rhesus D antigen and to a pharmaceutical composition containing a mixture of the said antibodies, more particularly intended for the prophylaxis of the haemolytic disease of the newborn. The invention also relates to the heterohybridoma cell lines that produce these antibodies, which are filed with the "Deutsche Sammlung von Mikroorganismen und Zellkulturen" under accession numbers DSM AC 2039 and DSM AC 2040.
摘要翻译：本发明涉及针对恒河猴D抗原的亚类IgG1和IgG3的2种人单克隆抗体，以及含有所述抗体混合物的药物组合物，更特别涉及用于预防新生儿溶血性疾病。本发明还涉及产生这些抗体的异源杂交瘤细胞系，其以保藏号DSM AC2039和DSM AC2040与“Deutsche Sammlung von Mikroorganismen und Zellkulturen”一起提交。

6. 外观设计

USD1004995S1 Fold-out cabinet bed 有权
公开(公告)号：USD1004995S1
公开(公告)日：2023-11-21
申请号：US29778929
申请日：2021-04-15
申请人： Peter Byrne
设计人： Peter Byrne
摘要： FIG. 1 is a front side elevation view of a fold-out cabinet bed, showing my design in a first position;
FIG. 2 is a back side elevation view thereof;
FIG. 3 is a left side elevation view thereof;
FIG. 4 is a right side elevation view thereof;
FIG. 5 is a top plan view thereof;
FIG. 6 is a bottom plan view thereof;
FIG. 7 is a front perspective view of the fold-out cabinet bed of FIG. 1, showing my new design in a second position;
FIG. 8 is a left side elevation view thereof;
FIG. 9 is a front side elevation view thereof;
FIG. 10 is a front perspective view of the fold-out cabinet bed of FIG. 1, showing my new design in a third position;
FIG. 11 is a front side elevation view thereof;
FIG. 12 is a back side elevation view thereof;
FIG. 13 is a top plan view thereof;
FIG. 14 is a left side elevation view thereof; and,
FIG. 15 is a bottom plan view thereof.
The broken lines in the figures show portions of the fold-out cabinet bed which form no part of the claimed design.

7. 发明授权

US08612390B2 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的完整范围的日志块。作为第一次搜索的一部分，一个或多个链接被跟随，向前和/或向后到一个或多个其他日志缓冲器。该方法还可以包括通过将一个或多个链路向前和/或向后追溯到一个或多个其它日志缓冲区来确定不发现第一日志块，并且因此，遵循一个或多个覆盖指针到一个或多个日志缓冲器搜索第一个日志块。

8. 植物专利

USPP23031P2 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”，其特征是其均匀，直立和堆积的植物习性; 中度生长习惯; 自由分支习惯; 绿色和淡黄色杂色叶; 季节开花响应; 大花序与红色花苞片; 并具有良好的后期制作寿命。

9. 外观设计

USD1006475S1 Fold-out cabinet bed 有权
公开(公告)号：USD1006475S1
公开(公告)日：2023-12-05
申请号：US29778947
申请日：2021-04-15
申请人： Peter Byrne
设计人： Peter Byrne
摘要： FIG. 1 is a front side elevation view of a fold-out cabinet bed, showing my design in a first position;
FIG. 2 is a back side elevation view thereof;
FIG. 3 is a left side elevation view thereof;
FIG. 4 is a right side elevation view thereof;
FIG. 5 is a top plan view thereof;
FIG. 6 is a bottom plan view thereof;
FIG. 7 is a front perspective view of the fold-out cabinet bed of FIG. 1, showing my new design in a second position;
FIG. 8 is a left side elevation view thereof;
FIG. 9 is a front side elevation view thereof;
FIG. 10 is a front perspective view of the fold-out cabinet bed of FIG. 1, showing my new design in a third position;
FIG. 11 is a front side elevation view thereof;
FIG. 12 is a back side elevation view thereof;
FIG. 13 is a top plan view thereof;
FIG. 14 is a left side elevation view thereof; and,
FIG. 15 is a bottom plan view thereof.
The broken lines in the figures show portions of the fold-out cabinet bed which form no part of the claimed design.

10. 发明授权

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

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式