会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Efficient recovery of replicated data items
    • 有效地恢复复制的数据项
    • US07734573B2
    • 2010-06-08
    • US11013274
    • 2004-12-14
    • John P. MacCormickChandramohan A. ThekkathLidong Zhou
    • John P. MacCormickChandramohan A. ThekkathLidong Zhou
    • G06F17/30
    • G06F11/1469G06F11/1451G06F11/1471Y10S707/99953
    • Methods and apparatuses are provided for recovering one or more replicated datasets. In accordance to some embodiments of the invention, this is accomplished by determining whether a log contains one or more entries indicating a corruption in a replicated data item; and recovering the replicated data item if the log contains any such entries. The log, however, is maintained at a higher layer in a software hierarchy than the layer at which the replicated data item is recovered. As a result, there is no need to maintain a separate replication log at the layer where the replicated data item is recovered. In accordance to some embodiments of the invention, this is accomplished by recording an entry indicating that an operation was performed on a replicated record in a log at a higher layer in a software hierarchy, determining whether a failure occurred during the operation, and reconciling the replicated record at a lower layer in the software hierarchy if it is determined that a failure occurred during the operation. As a result, the present invention eliminates the need for additional disk writes required by conventional techniques that use a replication log to at the same layer where the data recovery is performed.
    • 提供了用于恢复一个或多个复制数据集的方法和装置。 根据本发明的一些实施例,这是通过确定日志是否包含指示复制数据项中的损坏的一个或多个条目来实现的; 并且如果日志包含任何这样的条目,则恢复复制的数据项。 然而,日志在软件层次结构中保留在复制数据项恢复的层的较高层。 因此,无需在复制的数据项被恢复的层上维护单独的复制日志。 根据本发明的一些实施例,这是通过记录指示对软件层级中较高层的日志中的复制记录执行操作的条目,确定在操作期间是否发生故障,并且 如果确定在操作期间发生故障,则在软件层次结构中较低层的复制记录。 结果,本发明消除了对在执行数据恢复的同一层使用复制日志的常规技术所需的附加磁盘写入的需要。
    • 7. 发明授权
    • Performing a deletion of a node in a tree data storage structure
    • 执行树数据存储结构中节点的删除
    • US07630998B2
    • 2009-12-08
    • US11149593
    • 2005-06-10
    • Lidong ZhouChandramohan A. Thekkath
    • Lidong ZhouChandramohan A. Thekkath
    • G06F17/00G06F7/00
    • G06F17/30961Y10S707/99942Y10S707/99944
    • The addition of a layer between a tree data storage structure and a persistent storage is disclosed. The additional layer, called a storage module, generates an identifier and allocates it to a node in the tree data storage structure. The storage module additionally performs a mapping function, allocating the identifier to a location in persistent storage. If the node is later deleted from the tree data storage structure, then the mapping of the identifier to the location in persistent storage is likewise deleted. In this way, if the node is deleted and, concurrently, a lookup or write operation is attempted on the deleted node, the storage module will read the identifier associated with the deleted node but will not be able to map the identifier to a location in persistent storage. Instead, an exception is generated and sent to the tree data storage module.
    • 公开了在树数据存储结构和持久存储器之间添加层。 称为存储模块的附加层生成一个标识符,并将其分配给树形数据存储结构中的一个节点。 存储模块还执行映射功能,将标识符分配给持久存储器中的位置。 如果稍后从树数据存储结构中删除节点,则同样删除标识符到持久存储器中的位置的映射。 以这种方式,如果节点被删除,并且并发地在被删除的节点上尝试查找或写入操作,则存储模块将读取与被删除的节点相关联的标识符,但是将不能将标识符映射到 持久存储。 相反,会生成异常并将其发送到树数据存储模块。
    • 8. 发明授权
    • Implementing a tree data storage structure in a distributed environment
    • 在分布式环境中实现树状数据存储结构
    • US07730101B2
    • 2010-06-01
    • US11149656
    • 2005-06-10
    • Lidong ZhouChandramohan A. Thekkath
    • Lidong ZhouChandramohan A. Thekkath
    • G06F7/00G06F17/30
    • G06F17/30362G06F17/30327
    • Tree data storage structures are implemented on respective computers in a distributed environment, such as on a network, so that information associated with nodes of one computer's tree data storage structure may be read or written to by another computer in the network. To promote efficiency, a cache may be employed on the computers in the network such that each computer caches information associated with nodes of tree data storage structures located on the computers in the network. A lock service may implement a caching protocol to provide efficient concurrency of caching operations while ensuring that current information associated with the nodes is available to all computers in the network.
    • 树数据存储结构在诸如网络上的分布式环境中的相应计算机上实现,使得与一个计算机的树数据存储结构的节点相关联的信息可以被网络中的另一计算机读取或写入。 为了提高效率,可以在网络中的计算机上采用缓存,使得每个计算机缓存与位于网络中的计算机上的树数据存储结构的节点相关联的信息。 锁定服务可以实现缓存协议以提供高速缓存操作的并发性,同时确保与节点相关联的当前信息可用于网络中的所有计算机。