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

1. 发明申请

US20070067576A1 Balanced prefetching exploiting structured data 失效
标题翻译：平衡预取利用结构化数据
公开(公告)号：US20070067576A1
公开(公告)日：2007-03-22
申请号：US11230028
申请日：2005-09-19
申请人： Chandramohan Thekkath , John MacCormick , Lidong Zhou , Nicholas Murphy
发明人： Chandramohan Thekkath , John MacCormick , Lidong Zhou , Nicholas Murphy
IPC分类号： G06F12/00
CPC分类号： G06F12/0862 , G06F2212/6022
摘要： Balanced prefetching automatically balances the benefits of prefetching data that has not been accessed recently against the benefits of caching recently accessed data, and can be applied to most types of structured data without needing application-specific details or hints. Balanced prefetching is performed in applications in a computer system, such as storage-centric applications, including file systems and databases. Balanced prefetching exploits the structure of the data being prefetched, providing superior application throughput. For a fixed amount of memory, it is automatically and dynamically determined how much memory should be devoted to prefetching.
摘要翻译：平衡预取自动平衡了最近未被访问的预取数据的优点与缓存最近访问的数据的好处，并且可以应用于大多数类型的结构化数据，而无需特定于应用程序的详细信息或提示。在计算机系统的应用程序中执行平衡预取，例如以存储为中心的应用程序，包括文件系统和数据库。平衡预取利用了预取数据的结构，提供卓越的应用程序吞吐量。对于固定的内存量，它会自动和动态地确定应该将多少内存用于预取。

2. 发明申请

US20060155781A1 Systems and methods for structuring distributed fault-tolerant systems 审中-公开
标题翻译：构建分布式容错系统的系统和方法
公开(公告)号：US20060155781A1
公开(公告)日：2006-07-13
申请号：US11032374
申请日：2005-01-10
申请人： John MacCormick , Chandramohan Thekkath , Lidong Zhou
发明人： John MacCormick , Chandramohan Thekkath , Lidong Zhou
IPC分类号： G06F17/30
CPC分类号： G06F16/27
摘要： High-performance, scalable, and fault-tolerant distributed systems include decoupling data replication functions from reconfiguration and read functions to optimize system performance and provide a clean separation between scalability and fault tolerance. Each data object is replicated on multiple servers and a data replication protocol can be used to ensure data consistency. Read requests can be streamlined because any server can satisfy a read request, thus improving read performance, throughput, and overall system performance.
摘要翻译：高性能，可扩展和容错的分布式系统包括将数据复制功能与重新配置和读取功能脱钩，以优化系统性能，并在可扩展性和容错之间提供干净的隔离。每个数据对象在多个服务器上复制，并且可以使用数据复制协议来确保数据一致性。读取请求可以简化，因为任何服务器都可以满足读取请求，从而提高读取性能，吞吐量和整体系统性能。

3. 发明申请

US20060282438A1 Performing a deletion of a node in a tree data storage structure 失效
公开(公告)号：US20060282438A1
公开(公告)日：2006-12-14
申请号：US11149593
申请日：2005-06-10
申请人： Lidong Zhou , Chandramohan Thekkath
发明人： Lidong Zhou , Chandramohan Thekkath
IPC分类号： G06F7/00
CPC分类号： G06F17/30961 , Y10S707/99942 , Y10S707/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.

4. 发明申请

US20060282481A1 Implementing a tree data storage structure in a distributed environment 有权
标题翻译：在分布式环境中实现树状数据存储结构
公开(公告)号：US20060282481A1
公开(公告)日：2006-12-14
申请号：US11149656
申请日：2005-06-10
申请人： Lidong Zhou , Chandramohan Thekkath
发明人： Lidong Zhou , Chandramohan Thekkath
IPC分类号： G06F17/30
CPC分类号： G06F17/30362 , G06F17/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.
摘要翻译：树数据存储结构在诸如网络上的分布式环境中的相应计算机上实现，使得与一个计算机的树数据存储结构的节点相关联的信息可以被网络中的另一计算机读取或写入。为了提高效率，可以在网络中的计算机上采用缓存，使得每个计算机缓存与位于网络中的计算机上的树数据存储结构的节点相关联的信息。锁定服务可以实现缓存协议以提供高速缓存操作的并发性，同时确保与节点相关联的当前信息可用于网络中的所有计算机。

5. 发明申请

US20060129612A1 Efficient recovery of replicated data items 有权
标题翻译：有效地恢复复制的数据项
公开(公告)号：US20060129612A1
公开(公告)日：2006-06-15
申请号：US11013274
申请日：2004-12-14
申请人： John MacCormick , Chandramohan Thekkath , Lidong Zhou
发明人： John MacCormick , Chandramohan Thekkath , Lidong Zhou
IPC分类号： G06F17/30
CPC分类号： G06F11/1469 , G06F11/1451 , G06F11/1471 , Y10S707/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.
摘要翻译：提供了用于恢复一个或多个复制数据集的方法和装置。根据本发明的一些实施例，这是通过确定日志是否包含指示复制数据项中的损坏的一个或多个条目来实现的; 并且如果日志包含任何这样的条目，则恢复复制的数据项。然而，日志在软件层次结构中保留在复制数据项恢复的层的较高层。因此，无需在复制的数据项被恢复的层上维护单独的复制日志。根据本发明的一些实施例，这是通过记录指示对软件层级中较高层的日志中的复制记录执行操作的条目，确定在操作期间是否发生故障，并且如果确定在操作期间发生故障，则在软件层次结构中较低层的复制记录。结果，本发明消除了对在执行数据恢复的同一层使用复制日志的常规技术所需的附加磁盘写入的需要。

6. 发明申请

US20050071336A1 Systems and methods for logging and recovering updates to data structures 审中-公开
标题翻译：用于记录和恢复数据结构更新的系统和方法
公开(公告)号：US20050071336A1
公开(公告)日：2005-03-31
申请号：US10674676
申请日：2003-09-30
申请人： Marc Najork , Chandramohan Thekkath , Lidong Zhou
发明人： Marc Najork , Chandramohan Thekkath , Lidong Zhou
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F16/2246
摘要： Systems and methods for logging and recovering updates to data structures in the event of failure of an information management system are provided. In exemplary implementations, methods for implementing an efficient redo log for a data structure that is concurrently accessed by multiple clients is provided. The data structure is implemented in two layers: the data structure algorithm layer which sits atop an allocator that provides distributed, persistent, and replicated storage allocation. Both the B-link tree algorithm layer and the allocator use the service of the logging mechanism to implement fault-tolerance and atomicity guarantees. The present invention uses a single log and allows periodic truncation of that log for space efficiency.
摘要翻译：提供了在信息管理系统发生故障时记录和恢复数据结构更新的系统和方法。在示例性实现中，提供了用于实现由多个客户端同时访问的数据结构的有效重做日志的方法。数据结构分为两层：数据结构算法层，位于分配器上方，提供分布式，持久性和复制存储分配。 B链路树算法层和分配器都使用日志记录机制的服务来实现容错和原子保证。本发明使用单个日志并且允许该日志的周期性截断以获得空间效率。

7. 发明申请

US20060179086A1 Deletion and compaction using versioned nodes 有权
标题翻译：使用版本控制的节点进行删除和压缩
公开(公告)号：US20060179086A1
公开(公告)日：2006-08-10
申请号：US11376920
申请日：2006-03-16
申请人： Marc Najork , Chandramohan Thekkath
发明人： Marc Najork , Chandramohan Thekkath
IPC分类号： G06F17/30
CPC分类号： G06F17/30961 , Y10S707/99944
摘要： An information management system includes a database comprising a B-Tree data structure. The B-Tree includes a plurality of nodes associated with disk blocks, handles stored in the nodes, and version numbers attached to each of the handles and disk blocks. In addition, a method is provided that can include initially assigning version numbers to disk blocks, wherein the disk blocks are associated with nodes in a B-Tree data structure, and then performing an allocate operation whereby a handle identifying a disk block is returned along with the disk block's version number.
摘要翻译：信息管理系统包括包含B-Tree数据结构的数据库。 B树包括与磁盘块相关联的多个节点，存储在节点中的句柄以及附加到每个句柄和磁盘块的版本号。另外，提供了一种可以包括首先将版本号分配给磁盘块的方法，其中磁盘块与B-Tree数据结构中的节点相关联，然后执行分配操作，由此将标识磁盘块的句柄返回与磁盘块的版本号。

8. 发明申请

US20060026188A1 Algorithm for tree traversals using left links 有权
标题翻译：使用左链接的树遍历算法
公开(公告)号：US20060026188A1
公开(公告)日：2006-02-02
申请号：US11219140
申请日：2005-09-01
申请人： Marc Najork , Chandramohan Thekkath
发明人： Marc Najork , Chandramohan Thekkath
IPC分类号： G06F7/00
CPC分类号： G06F17/30958 , Y10S707/918 , Y10S707/99944
摘要： An information management system includes a computer and a database comprising a B-Tree data structure comprising a plurality of nodes associated with disk blocks and handles stored in the nodes. At least one left-link handle, hleft, stored in each node points to a left sibling of that node. A mechanism for performing a lookup operation with respect to a key, k, traverses the B-Tree and refers to the left-link handle, hleft, of a node to access a left sibling of the node if the key k is less than or equal to a value kmin stored in the node. Mechanisms are also provided for performing insert and delete operations, and the lookup, insert, and delete operations detect if the key range of an index node, A, does not include the key k that the operation is trying to locate, and follow a handle A.hleft to the left sibling when k≦A.kmin.
摘要翻译：信息管理系统包括计算机和包括B-Tree数据结构的数据库，该B-Tree数据结构包括与磁盘块相关联的多个节点和存储在节点中的句柄。存储在每个节点中的至少一个左链接句柄h _{指向该节点的左兄弟节点。用于执行关于密钥k的查找操作的机制遍历B树并且参考节点的左链接句柄html左侧来访问节点的左兄弟节点如果密钥k小于或等于存储在节点中的值k分钟。还提供了用于执行插入和删除操作的机制，并且查找，插入和删除操作检测索引节点A的关键范围是否不包括操作正在查找的密钥k，并遵循句柄当k <= AK分钟时，向左兄弟姐妹左边。}

9. 发明申请

US20060221860A1 Nodal pattern configuration 失效
公开(公告)号：US20060221860A1
公开(公告)日：2006-10-05
申请号：US11096811
申请日：2005-03-31
申请人： Mark Manasse , Alice Silverberg , Chandramohan Thekkath
发明人： Mark Manasse , Alice Silverberg , Chandramohan Thekkath
IPC分类号： H04L12/28
CPC分类号： H04L12/66
摘要： Nodal pattern configuration is described, including generating successive values at a source node, processing the successive values using a plurality of intermediate nodes, sending the processed values from a node in the plurality of intermediate nodes to a destination node, and configuring the plurality of intermediate nodes such that each node of the plurality of intermediate nodes, concurrently performs at least two actions. Also, nodal pattern configuration includes generating a series of data blocks at a source node, processing data blocks from the series of data blocks using a plurality of intermediate nodes in data communication with the source node, each node of the plurality of intermediate nodes being configured to concurrently perform at least two operations, and sending processed data blocks from the plurality of intermediate nodes to a destination node, the destination node being in data communication with the plurality of intermediate nodes.

10. 发明申请

US20050036500A1 Method and system for initializing host location information across smart bridge topology changes 有权
标题翻译：在智能桥拓扑变化中初始化主机位置信息的方法和系统
公开(公告)号：US20050036500A1
公开(公告)日：2005-02-17
申请号：US10642002
申请日：2003-08-15
申请人： Thomas Rodeheffer , Mark Lillibridge , Chandramohan Thekkath
发明人： Thomas Rodeheffer , Mark Lillibridge , Chandramohan Thekkath
IPC分类号： H04L12/46 , H04L12/56 , H04L12/28 , G06F15/16
CPC分类号： H04L12/462 , H04L45/02 , H04L45/48
摘要： A network includes multiple segments and bridges interconnecting the segments, with hosts coupled to the segments. The bridges are smart bridges that each perform a host location initialization function. The host location initialization function in one bridge is performed in corporation with all other bridges in the bridged network via an instance through a propagation order spanning tree (POST). The initialization method includes obtaining prior host location information which is at least a partial representation of the host locations in the bridged network before the network topology change, obtaining hints on host location changes resulting from the network topology change, and modifying the prior host location information according to the hints to construct host location information for initialization. Location information for at least a portion of the hosts in the bridged network is preserved or discovered quickly each time when the network topology changes.
摘要翻译：网络包括多个段和桥连接这些段，与主机耦合到段。桥是每个执行主机位置初始化功能的智能桥。一个桥中的主机位置初始化功能是通过一个实例通过传播顺序生成树（POST）与桥接网络中的所有其他网桥一起执行的。所述初始化方法包括：在所述网络拓扑变化之前获得作为所述桥接网络中的主机位置的至少部分表示的先前主机位置信息，获得由所述网络拓扑变化导致的主机位置改变的提示，以及修改所述先前主机位置信息根据提示构建主机位置信息进行初始化。每当网络拓扑发生变化时，桥接网络中至少一部分主机的位置信息将被快速保存或发现。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式