会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • SYNCHRONIZATION PROTOCOL FOR LOOSELY COUPLED DEVICES
    • 用于耦合耦合器件的同步协议
    • US20080162728A1
    • 2008-07-03
    • US11619262
    • 2007-01-03
    • Rafik RobealSudarshan A. ChitreSteven M. Lasker
    • Rafik RobealSudarshan A. ChitreSteven M. Lasker
    • G06F15/16
    • H04L67/1095G06F16/27
    • A transport agnostic synchronization protocol is provided for use in the context of loosely coupled clients. The synchronization protocol enables a stateless server freeing the server from maintaining synchronization state of ever scaling clients. A discoverability service is provided for clients to learn about different synchronization services for groups of data that the server provides such that the clients can choose or subscribe to synchronization groups of interest, and the protocol initializes the client with any schema of any data structures to which it subscribed that are unknown. Further, the protocol enables an extensible synchronization anchor model that carries an anchor type between client and server without requiring assumptions about client data structures allowing a wide spectrum of anchor data types and functionality.
    • 提供传输不可知同步协议用于松耦合客户端的上下文中。 同步协议允许无状态服务器释放服务器以保持不断扩展的客户端的同步状态。 为客户提供可发现性服务,以了解服务器提供的数据组的不同同步服务,以便客户端可以选择或订阅感兴趣的同步组,并且协议使用任何数据结构的任何模式初始化客户端 它订阅了这是未知的。 此外,该协议使得能够在客户机和服务器之间承载锚类型的可扩展同步锚模型,而不需要关于允许广泛锚定数据类型和功能的客户端数据结构的假设。
    • 4. 发明授权
    • Anchor for database synchronization excluding uncommitted transaction modifications
    • 锚定数据库同步,不包括未提交的事务修改
    • US07653664B2
    • 2010-01-26
    • US11592588
    • 2006-11-03
    • Sudarshan A. ChitreRafik RobealShaoyu Zhou
    • Sudarshan A. ChitreRafik RobealShaoyu Zhou
    • G06F12/00G06F17/30
    • G06F17/30575
    • Described is a technology in which an anchor value is determined, for example to synchronize a destination database or data store with modifications made to a source database. The new anchor value is determined in a manner that excludes modifications corresponding to any uncommitted transactions. The new anchor value may be based on a counter value or a date and time value stored with each modification. The new anchor value may be determined by comparing a first set of committed modifications that do not include uncommitted modifications against a second set of modifications that includes committed modifications and uncommitted modifications. Alternatively, the new anchor value may be determined from the earliest start date and time among the modifications that are part of any uncommitted transactions. The anchor may be used (e.g., via queries) to enumerate modifications for synchronization, and also for detecting conflicts between the source and destination databases.
    • 描述了一种技术,其中确定锚值,例如使目标数据库或数据存储与对源数据库的修改同步。 新的锚点值以排除与任何未提交交易相对应的修改的方式确定。 新的锚值可以基于每个修改存储的计数器值或日期和时间值。 可以通过将不包括未提交的修改的第一组提交的修改与包括已提交的修改和未提交的修改的第二组修改进行比较来确定新的锚值。 或者,可以从作为任何未提交事务的一部分的修改中的最早开始日期和时间来确定新的锚点值。 可以使用锚点(例如,经由查询)来枚举用于同步的修改,并且还用于检测源数据库和目的地数据库之间的冲突。
    • 5. 发明申请
    • Anchor for database synchronization excluding uncommitted transaction modifications
    • 锚定数据库同步,不包括未提交的事务修改
    • US20080109494A1
    • 2008-05-08
    • US11592588
    • 2006-11-03
    • Sudarshan A. ChitreRafik RobealShaoyu Zhou
    • Sudarshan A. ChitreRafik RobealShaoyu Zhou
    • G06F17/30
    • G06F17/30575
    • Described is a technology in which an anchor value is determined, for example to synchronize a destination database or data store with modifications made to a source database. The new anchor value is determined in a manner that excludes modifications corresponding to any uncommitted transactions. The new anchor value may be based on a counter value or a date and time value stored with each modification. The new anchor value may be determined by comparing a first set of committed modifications that do not include uncommitted modifications against a second set of modifications that includes committed modifications and uncommitted modifications. Alternatively, the new anchor value may be determined from the earliest start date and time among the modifications that are part of any uncommitted transactions. The anchor may be used (e.g., via queries) to enumerate modifications for synchronization, and also for detecting conflicts between the source and destination databases.
    • 描述了一种技术,其中确定锚值,例如使目标数据库或数据存储与对源数据库的修改同步。 新的锚点值以排除与任何未提交交易相对应的修改的方式确定。 新的锚值可以基于每个修改存储的计数器值或日期和时间值。 可以通过将不包括未提交的修改的第一组提交的修改与包括已提交的修改和未提交的修改的第二组修改进行比较来确定新的锚值。 或者,可以从作为任何未提交事务的一部分的修改中的最早开始日期和时间来确定新的锚点值。 可以使用锚点(例如,经由查询)来枚举用于同步的修改,并且还用于检测源数据库和目的地数据库之间的冲突。
    • 7. 发明授权
    • System and method for reliably replicating data
    • 用于可靠复制数据的系统和方法
    • US07707180B2
    • 2010-04-27
    • US10808987
    • 2004-03-24
    • David A. OrbitsPraerit GargSudarshan A. ChitreBalan Sethu Raman
    • David A. OrbitsPraerit GargSudarshan A. ChitreBalan Sethu Raman
    • G06F7/00G06F17/00
    • G06F17/30212G06F11/2097G06F17/30176G06F2201/82Y10S707/99953Y10S707/99954
    • Described is a system and method for replicating each of a set of resources to a subject computer in a replica set prior to making use of a resource in the set of resources. The set of resources includes resources that are dependent upon each other for a proper functioning of the group. A manifest file that identifies each resource in a group of interrelated resources is used. The manifest file is generated at one computer in the replica set (typically the computer at which a modification to one of the interrelated resources occurred). When the modification occurs to one of the set of resources, the manifest file is transmitted (e.g., itself replicated) to each computer in the replica set. The manifest file includes an indicator that identifies the manifest file as a special file. When received at another computer in the replica set, a service evaluates the manifest file to identify whether the appropriate versions of the identified resources exist at the receiving computer. If not, the service at that computer awaits the receipt of each resource. The wait period may include delaying the execution of an application associated with (or even included within) the manifest file from launching. Alternatively, the FRS could simply disallow access to one or more resources identified in the manifest file until all have arrived. When all have arrived, the FRS releases control of the identified resources, which may then operate or be accessed in the ordinary manner.
    • 描述了一种在使用资源集合中的资源之前将一组资源中的每一个复制到副本集中的主题计算机的系统和方法。 该资源集合包括彼此依赖的资源,以便该组正常运行。 使用标识一组相关资源中的每个资源的清单文件。 清单文件在副本集中的一台计算机上生成(通常是发生对相关资源之一的修改的计算机)。 当修改发生到该组资源之一时,清单文件被传送(例如,自己复制)到副本集合中的每个计算机。 清单文件包括将清单文件标识为特殊文件的指示符。 当在副本集合中的另一台计算机上接收时,服务将评估清单文件以识别在接收计算机上是否存在所识别的资源的适当版本。 如果没有,则该计算机上的服务等待接收每个资源。 等待期可以包括延迟与清单文件相关联(或甚至包括在内)中的应用的启动。 或者,FRS可以简单地不允许访问清单文件中识别的一个或多个资源,直到所有到达。 当所有人都到达时,FRS释放对所识别资源的控制,然后可以以普通方式操作或访问。
    • 9. 发明授权
    • System and method for replicating data in resource sets
    • 在资源集中复制数据的系统和方法
    • US06917951B2
    • 2005-07-12
    • US09917261
    • 2001-07-26
    • David A. OrbitsPraerit GargSudarshan A. ChitreBalan Sethu Raman
    • David A. OrbitsPraerit GargSudarshan A. ChitreBalan Sethu Raman
    • G06F11/20G06F17/30
    • G06F17/30212G06F11/2097G06F17/30176G06F2201/82Y10S707/99953Y10S707/99954
    • Described is a system and method for replicating each of a set of resources to a subject computer in a replica set prior to making use of a resource in the set of resources. The set of resources includes resources that are dependent upon each other for a proper functioning of the group. A manifest file that identifies each resource in a group of interrelated resources is used. The manifest file is generated at one computer in the replica set (typically the computer at which a modification to one of the interrelated resources occurred). When the modification occurs to one of the set of resources, the manifest file is transmitted (e.g., itself replicated) to each computer in the replica set. The manifest file includes an indicator that identifies the manifest file as a special file. When received at another computer in the replica set, a service evaluates the manifest file to identify whether the appropriate versions of the identified resources exist at the receiving computer. If not, the service at that computer awaits the receipt of each resource. The wait period may include delaying the execution of an application associated with (or even included within) the manifest file from launching. Alternatively, the FRS could simply disallow access to one or more resources identified in the manifest file until all have arrived. When all have arrived, the FRS releases control of the identified resources, which may then operate or be accessed in the ordinary manner.
    • 描述了一种在使用资源集合中的资源之前将一组资源中的每一个复制到副本集中的主题计算机的系统和方法。 该资源集合包括彼此依赖的资源,以便该组正常运行。 使用标识一组相关资源中的每个资源的清单文件。 清单文件在副本集中的一台计算机上生成(通常是发生对相关资源之一的修改的计算机)。 当修改发生到该组资源之一时,清单文件被传送(例如,自己复制)到副本集合中的每个计算机。 清单文件包括将清单文件标识为特殊文件的指示符。 当在副本集合中的另一台计算机上接收时,服务将评估清单文件以识别在接收计算机上是否存在所识别的资源的适当版本。 如果没有,则该计算机上的服务等待接收每个资源。 等待期可以包括延迟与清单文件相关联(或甚至包括在内)中的应用的启动。 或者,FRS可以简单地不允许访问清单文件中识别的一个或多个资源,直到所有到达。 当所有人都到达时,FRS释放对所识别资源的控制,然后可以以普通方式操作或访问。