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

1. 发明申请

US20110167038A1 Dispatching Conflicting Data Changes 有权
标题翻译：调度冲突的数据变化
公开(公告)号：US20110167038A1
公开(公告)日：2011-07-07
申请号：US12683440
申请日：2010-01-07
申请人： Rui Wang , Michael Habben , Qun Guo , Artem Oks
发明人： Rui Wang , Michael Habben , Qun Guo , Artem Oks
IPC分类号： G06F17/30
CPC分类号： G06F17/30575
摘要： A method for distributing one or more conflicting data changes. The method includes extracting data changes from the source site log, and applying the data changes to the destination site. The method then includes identifying one or more constraints for each data change and generating a hash value for each identified constraint. The method then dispatches the data changes into a plurality of streams based on the hash values. The hash values are used to identify conflicting data changes and determine how the data changes should be sent through the plurality of streams such that data changes are applied in parallel in the plurality of streams without violating any causal consistency constraints. The method then includes committing data changes in the plurality of streams to the destination site in a single transaction, creating a consistent transactional view.
摘要翻译：一种用于分发一个或多个冲突数据更改的方法。该方法包括从源站点日志中提取数据更改，并将数据更改应用于目标站点。该方法然后包括识别每个数据改变的一个或多个约束，并为每个识别的约束生成哈希值。然后，该方法基于散列值将数据变化分派到多个流中。哈希值用于识别冲突的数据变化并确定如何通过多个流发送数据变化，使得在多个流中并行地应用数据改变而不违反任何因果一致性约束。该方法然后包括在单个事务中将多个流中的数据更改提交到目标站点，从而创建一致的事务视图。

2. 发明授权

US08756192B2 Dispatching conflicting data changes 有权
标题翻译：调度冲突的数据更改
公开(公告)号：US08756192B2
公开(公告)日：2014-06-17
申请号：US12683440
申请日：2010-01-07
申请人： Rui Wang , Michael Habben , Qun Guo , Artem Oks
发明人： Rui Wang , Michael Habben , Qun Guo , Artem Oks
IPC分类号： G06F17/30
CPC分类号： G06F17/30575
摘要： A method for distributing one or more conflicting data changes. The method includes extracting data changes from the source site log, and applying the data changes to the destination site. The method then includes identifying one or more constraints for each data change and generating a hash value for each identified constraint. The method then dispatches the data changes into a plurality of streams based on the hash values. The hash values are used to identify conflicting data changes and determine how the data changes should be sent through the plurality of streams such that data changes are applied in parallel in the plurality of streams without violating any causal consistency constraints. The method then includes committing data changes in the plurality of streams to the destination site in a single transaction, creating a consistent transactional view.
摘要翻译：一种用于分发一个或多个冲突数据更改的方法。该方法包括从源站点日志中提取数据更改，并将数据更改应用于目标站点。该方法然后包括识别每个数据改变的一个或多个约束，并为每个识别的约束生成哈希值。然后，该方法基于散列值将数据变化分派到多个流中。哈希值用于识别冲突的数据变化并确定如何通过多个流发送数据变化，使得在多个流中并行地应用数据改变而不违反任何因果一致性约束。该方法然后包括在单个事务中将多个流中的数据更改提交到目标站点，从而创建一致的事务视图。

3. 发明授权

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

4. 发明授权

US08108343B2 De-duplication and completeness in multi-log based replication 有权
标题翻译：基于多日志的复制中的重复数据删除和完整性
公开(公告)号：US08108343B2
公开(公告)日：2012-01-31
申请号：US12428495
申请日：2009-04-23
申请人： Rui Wang , Qun Guo , Yixue Zhu , Michael E. Habben
发明人： Rui Wang , Qun Guo , Yixue Zhu , Michael E. Habben
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30575 , G06F17/30368
摘要： Aspects of the subject matter described herein relate to multi-log based replication. In aspects, database fragments are associated with different logs. Each change to a duplicated database record may be recorded in multiple logs. A history data structure is used to determine when duplication schemas are valid. A duplication schema indicates what database fragments duplicate one or more database records. For a particular time range, the duplication schema history is used to determine whether currently available logs include all changes. If multiple logs include the same change, one log may be selected to provide the change. Non-duplicative changes may be placed into a single data stream usable to update a remote database.
摘要翻译：本文描述的主题的方面涉及基于多日志的复制。在方面，数据库碎片与不同的日志相关联。对重复数据库记录的每次更改可能会记录在多个日志中。历史数据结构用于确定重复模式何时有效。复制模式指示什么数据库片段复制一个或多个数据库记录。对于特定时间范围，复制模式历史记录用于确定当前可用日志是否包括所有更改。如果多个日志包含相同的更改，则可以选择一个日志来提供更改。可以将不重复的更改放置在可用于更新远程数据库的单个数据流中。

5. 发明申请

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

6. 发明授权

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

7. 发明申请

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

8. 发明授权

US07979393B2 Multiphase topology-wide code modifications for peer-to-peer systems 有权
标题翻译：对等系统的多相拓扑范围的代码修改
公开(公告)号：US07979393B2
公开(公告)日：2011-07-12
申请号：US12036002
申请日：2008-02-22
申请人： Rui Wang , Qun Guo , Dennis Michael Tighe , Gopal Ashok , Peng Song
发明人： Rui Wang , Qun Guo , Dennis Michael Tighe , Gopal Ashok , Peng Song
IPC分类号： G06F17/30
CPC分类号： H04L67/104 , H04L67/1042 , H04L67/1046
摘要： Systems and methods that supply changes on-the-fly and without breaking execution of codes for schema changes in a peer-to-peer environment. The modification component supplies changes to peers or nodes in a topology by initially identifying dependencies (e.g., multiple level) that can be affected by the schema change, followed by performing the schema change to the codes or stored procedures. Accordingly, dependencies in an entire system can be refreshed, wherein multiple levels of dependencies can exist.
摘要翻译：提供更改的系统和方法，并在不间断执行对等环境中的模式更改代码。修改组件通过初始识别可能受模式更改影响的依赖性（例如，多级别），然后对代码或存储过程执行模式更改，向拓扑中的对等体或节点提供更改。因此，可以刷新整个系统中的依赖关系，其中可以存在多个级别的依赖性。

9. 发明申请

US20100274768A1 DE-DUPLICATION AND COMPLETENESS IN MULTI-LOG BASED REPLICATION 有权
标题翻译：多重复制的复制和完整性
公开(公告)号：US20100274768A1
公开(公告)日：2010-10-28
申请号：US12428495
申请日：2009-04-23
申请人： Rui Wang , Qun Guo , Yixue Zhu , Michael E. Habben
发明人： Rui Wang , Qun Guo , Yixue Zhu , Michael E. Habben
IPC分类号： G06F7/00 , G06F12/08 , G06F12/00
CPC分类号： G06F17/30575 , G06F17/30368
摘要： Aspects of the subject matter described herein relate to multi-log based replication. In aspects, database fragments are associated with different logs. Each change to a duplicated database record may be recorded in multiple logs. A history data structure is used to determine when duplication schemas are valid. A duplication schema indicates what database fragments duplicate one or more database records. For a particular time range, the duplication schema history is used to determine whether currently available logs include all changes. If multiple logs include the same change, one log may be selected to provide the change. Non-duplicative changes may be placed into a single data stream usable to update a remote database.
摘要翻译：本文描述的主题的方面涉及基于多日志的复制。在方面，数据库碎片与不同的日志相关联。对重复数据库记录的每次更改可能会记录在多个日志中。历史数据结构用于确定重复模式何时有效。复制模式指示什么数据库片段复制一个或多个数据库记录。对于特定时间范围，复制模式历史记录用于确定当前可用日志是否包括所有更改。如果多个日志包含相同的更改，则可以选择一个日志来提供更改。可以将不重复的更改放置在可用于更新远程数据库的单个数据流中。

10. 发明申请

US20100125557A1 ORIGINATION BASED CONFLICT DETECTION IN PEER-TO-PEER REPLICATION 审中-公开
标题翻译：基于对等的冲突检测在同行对等
公开(公告)号：US20100125557A1
公开(公告)日：2010-05-20
申请号：US12272382
申请日：2008-11-17
申请人： Rui Wang , Qun Guo , Peng Song , Dennis Michael Tighe , Gopal Ashok , Michael E. Habben
发明人： Rui Wang , Qun Guo , Peng Song , Dennis Michael Tighe , Gopal Ashok , Michael E. Habben
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F16/27 , G06F16/1834
摘要： Systems and methods that enable conflict detection in a peer-to-peer replication by embedding origination information in data records. A tracing component can track embedded information in form of peer ID and transaction ID, wherein conflicts can be detected by comparing a pre-version (prior to current version) of data on the source node—with—a current version of the data on the destination node.
摘要翻译：通过在数据记录中嵌入发起信息来启用对等复制中的冲突检测的系统和方法。跟踪组件可以以对等体ID和事务ID的形式跟踪嵌入信息，其中可以通过将源节点上的数据的前版本（在当前版本之前）与当前版本的数据的当前版本进行比较来检测冲突目的地节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式