US 7,917,474 B2Grant
Systems and methods for accessing and updating distributed data
Issue Date:2011-03-29
•23 Claims
•21 Drawing Sheets
Abstract
Systems and methods are disclosed that provide an indexing data structure. In one embodiment, the indexing data structure is mirrored index tree where the copies of the nodes of the tree are stored across devices in a distributed system. In one embodiment, nodes that are stored on an offline device are restored, and an offline device that comes back online is merged into the distributed system and given access to the current indexing data structure. In one embodiment, the indexing data structure is traversed to locate and restore nodes that are stored on offline devices of the distributed system.
Metadata
Assignee
- Isilon Systems, Inc.
Inventors
- Aaron J. Passey
- Darren P. Schack
- Peter J. Godman
- Robert J. Anderson
- Neal T. Fachan
Application Information
Application Number:US 11/255,337
Filing Date:2005-10-21
Priority Date:2005-10-21
Art Unit:2159
Classifications
IPC:
G06F7/00G06F17/00
Patent Drawings (21 sheets)
Description
REFERENCE TO RELATED APPLICATIONS
[0001] The present disclosure relates to U.S. patent application Ser. No. 11/255,817, titled “SYSTEMS AND METHODS FOR DISTRIBUTED SYSTEM SCANNING,” U.S. patent application Ser. No. 11/256,410, titled “SYSTEMS AND METHODS FOR PROVIDING VARIABLE PROTECTION,” U.S. patent application Ser. No. 11/255,346, titled “SYSTEMS AND METHODS FOR MANAGING CONCURRENT ACCESS REQUESTS TO A SHARED RESOURCE,” U.S. patent application Ser. No. 11/255,818, titled “SYSTEMS AND METHODS FOR MAINTAINING DISTRIBUTED DATA,” and U.S. patent application Ser. No. 11/256,317, titled “SYSTEMS AND METHODS FOR USING EXCITEMENT VALUES TO PREDICT FUTURE ACCESS TO RESOURCES,” each filed on Oct. 21, 2005 and each hereby incorporated by reference herein in their entirety.
FIELD OF THE INVENTION
[0002] The present disclosure generally relates to the field of distributed data management, and more particularly, to systems and methods for maintaining a copies of index data.
BACKGROUND
[0003] The increase in processing power of computer systems has ushered in a new era in which information is accessed on a constant basis. One response has been to store and maintain data in a distributed manner across multiple nodes or devices. A distributed architecture allows for more flexible configurations with respect to factors such as access speed, bandwidth management, and other performance and reliability parameters. The distributed architecture also allows multiple copies of data to be stored across the system. According, if one copy of the data is not available, then other copies of the data may be retrieved. One type of data that may be stored across a distributed system is indexing data.
[0004] The indexing data is desirably protected in the event that one or more of the devices of the distributed system fail. In addition, when a device fails, the offline indexing data is desirably restored in case of a failure by other devices. Moreover, additional problems occur when one or more of the failed devices come back online and try to reintegrate into the system.
[0005] Because of the foregoing challenges and limitations, there is an ongoing need to improve the manner in which indexing data, stored across a distributed system, is managed especially in the event of device failure.
SUMMARY
[0006] Systems and methods are disclosed that provide an indexing data structure. The indexing data structure is stored as nodes across a distributed system and copies of the nodes are also stored across the system. In some embodiments, the systems and methods restore nodes that are stored on an inaccessible portion of the distributed system. In some embodiments, portions of the system that become accessible are merged into the distributed system and given access to the current indexing data structure. In addition, in some embodiments, the indexing data structure is traversed to locate and restore nodes that are stored on inaccessible portions of the distributed system.
[0007] One embodiment of the present disclosure relates to an indexing system that includes a plurality of storage devices configured to communicate with each other. The system further includes a set of database records each record with a distinct index. The system further includes a balanced index tree structure. The balanced index tree structure includes a first and second copy of a set of leaf nodes stored among the plurality of storage devices configured to store the set of database records based on the indexes. The balanced index tree structure further includes a first and second copy of a set of parent nodes of the leaf nodes stored among the plurality of storage devices and configured to store references to the first and second copy of the set of leaf nodes. The balanced index tree structure further includes a first and second copy of a set of grandparent nodes of the leaf nodes stored among the plurality of storage devices, configured to store references to the first and second copy of the parent nodes. The balanced index tree structure further includes a first and second copy of a root node configured to store references to the first and second copy of the grandparent nodes. The set of parent nodes, set of grandparent nodes, and the root node are configured to index the first and second copy of the set of leaf nodes based on the indexes in the form of a balanced tree.
[0008] Another embodiment of the present disclosure relates to an indexing system that includes a plurality of storage devices configured to communicate with each other. The system further includes a set of data units. The set of data units includes an index value for each data unit. The system further includes an index data structure. The indexing data structure includes a first and second copy of a set of first nodes stored among the plurality of storage devices. The indexing data structure further includes a first and second copy of a set of second nodes stored among the plurality of storage devices. The first and second copy of the set of second nodes configured to store the set of data units based on the index values of each data unit. The first and second copy of the set of first nodes configured to index the first and second copy of the set of second nodes based on the index values of the data units stored in the second nodes.
[0009] Yet another embodiment of the present disclosure relates to a method for indexing data in an index tree. The method includes providing an index tree with inner nodes, leaf nodes, redundant copies of the inner nodes, and redundant copies of the leaf nodes. The method further includes receiving a first data with a first index. The method further includes traversing the index tree to select one of the leaf nodes on which to store first data based at least on the first index. The method further includes storing the first data on the selected leaf node. The method further includes storing the first data on the redundant copy of the selected leaf node. The method further includes traversing the inner nodes and redundant copies of the inner nodes that are parents of the selected leaf node to update metadata related to the inner nodes and the redundant copies of the inner nodes to reflect the stored first data.
[0010] Yet another embodiment of the present disclosure relates to a method of modifying nodes stored on distributed indexed tree. The method includes receiving a target node. The target node and a copy of the target node are stored among a plurality of devices. The method further includes accessing a parent node of the target node. The method further includes determining that the copy of the target node is stored on a failed device of the plurality of devices. The method further includes modifying the target node. The method further includes creating a new copy of the target node. The method further includes storing the new copy of the target node on at least one of the plurality of devices that is not a failed device. The method further includes recursively updating the parent node.
[0011] Yet another embodiment of the present disclosure relates to a method of restoring mirrored nodes of a distributed indexed tree. The method includes receiving a parent node. The method further includes, for each child of the parent node, determining that at least one copy of the child is located on a failed drive; retrieving a copy of the child from a non-failed drive; creating a new copy of the child; storing the new copy of the child on a non-failed drive; updating the parent and copies of the parent to reference the new copy of the child; and recursively restoring the child.
[0012] Yet another embodiment of the present disclosure relates to a method of merging a first device into a plurality of devices. The method includes providing a first device configured to store a version value. The method further includes providing a plurality of devices, with each of the plurality of devices being configured to reference at least two copies of a mirrored index data structure and to store a version value. The method further includes receiving the first version value. The method further includes querying the plurality of devices for their corresponding version values. The method further includes determining a highest version value from the version values. The method further includes determining whether the first version value is lower than the highest version value. The method further includes, if the first version value is lower than the highest version value, updating the version value of the first device to the highest version value; and updating the first device to reference the at least two copies of the mirrored index data structure.
[0013] Yet another embodiment of the present disclosure relates to a distributed system that includes a plurality of storage units. The system further includes a balanced index tree configured to be organized by index values comprising a root node, a copy of the root node, a plurality of nodes, and a copy of the plurality of nodes. The system further includes a storage module configured to store the root node, the copy of the root node, the plurality of nodes, and the copy of the plurality of nodes stored among the plurality of storage units. The system further includes index tree data stored on each of the plurality of storage units referencing the root node and the copy of the root node.
[0014] For purposes of this summary, certain aspects, advantages, and novel features of the invention are described herein. It is to be understood that not necessarily all such advantages may be achieved in accordance with any particular embodiment of the invention. Thus, for example, those skilled in the art will recognize that the invention may be embodied or carried out in a manner that achieves one advantage or group of advantages as taught herein without necessarily achieving other advantages as may be taught or suggested herein.
BRIEF DESCRIPTION OF THE DRAWINGS
[0015] FIG. 1 illustrates one embodiment of a high-level block diagram of one embodiment of an index tree.
[0016] FIG. 2 illustrates one embodiment of a high-level block diagram of one embodiment of an index tree with varying levels of protection.
[0017] FIG. 3A illustrates one embodiment of a high-level block diagram of one set of devices A, B, C, and D that are in communication with each other.
[0018] FIG. 3B illustrates one embodiment of a high-level block diagram of the set of devices A, B, C, and D of FIG. 3A where Device B has lost communication with the other devices.
[0019] FIG. 3C illustrates one embodiment of a high-level block diagram of the set of devices A, B, C, and D of FIG. 3B where Device B has lost communication with the other devices and after a modify has taken place.
[0020] FIG. 3D illustrates one embodiment of a high-level block diagram of the set of devices A, B, C, and D of FIG. 3C where Device B has rejoined the set of devices.
[0021] FIG. 4A illustrates one embodiment of a flow chart of a modify process.
[0022] FIG. 4B illustrates an additional embodiment of a flow chart of a modify process.
[0023] FIG. 5 illustrates one embodiment of a flow chart of a restore tree process.
[0024] FIG. 6 illustrates one embodiment of a flow chart of a restore node process.
[0025] FIG. 7 illustrates one embodiment of a flow chart of a merge process.
[0026] FIG. 8A illustrates one embodiment of a block diagram of a distributed system.
[0027] FIG. 8B illustrates another embodiment of a block diagram of a distributed system.
[0028] FIG. 9A illustrates one embodiment of a superblock.
[0029] FIG. 9B illustrates one embodiment of an inner node.
[0030] FIG. 9C illustrates one embodiment of a leaf node.
[0031] FIG. 10 illustrates one embodiment of a high-level block diagram of one embodiment of an index tree used to store database records.
[0032] FIG. 11 illustrates one embodiment of a leaf node used to store database records.
[0033] FIG. 12 illustrates one embodiment of a high-level block diagram of one embodiment of an index tree used to store addresses of metadata data structures.
[0034] FIG. 13 illustrates one embodiment of a leaf node used to store database records.
[0035] These and other aspects, advantages, and novel features of the present teachings will become apparent upon reading the following detailed description and upon reference to the accompanying drawings. The drawings and the associated descriptions are provided to illustrate embodiments of the invention and not to limit the scope of the invention. In the drawings, similar elements have may be marked with similar reference numerals.
DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
[0036] Systems and methods which represent various embodiments and example applications of the present disclosure will now be described with reference to the drawings.
[0037] For purposes of illustration, some embodiments will be described in the context of a distributed index tree and example environments in which a distributed index tree may be used are also disclosed. The inventors contemplate that the present invention is not limited by the type of environment in which the systems and methods are used, and that the systems and methods may be used in various environments, such as, for example, the Internet, the World Wide Web, a private network for a hospital, a broadcast network for a government agency, an internal network of a corporate enterprise, an intranet, a local area network, a wide area network, and so forth. It is also recognized that in other embodiments, the systems and methods may be implemented as a single module and/or implemented in conjunction with a variety of other modules and the like. Moreover, the specific implementations described herein are set forth in order to illustrate, and not to limit, the invention. The scope of the invention is defined by the appended claims.
I. OVERVIEW
[0038] The systems and methods of the present invention provide techniques for indexing data stored with varying protection levels. In one embodiment, the data is stored in a mirrored balanced tree, also referred to as an index tree, which indexes the data and stores it in the tree. Each leaf node represents a sorted group of the indexed data. Accordingly, when a modification is made to one node in the index tree, the same modification is made to other copies of that node. Similarly, when a node is added the index tree, the appropriate number of copies of the node are created and the parent node that references the new node includes references to each of the copies. Also, when a node is deleted from the index tree, references to all copies of the node are removed from the parent node.
[0039] In one embodiment, copies of the nodes of the mirrored index tree are distributed among a set of devices. Because copies of the nodes are stored on different devices, the index tree may tolerate the failure of one or more of the devices. When modifying nodes in the index tree, if the modification encounters a copy of node that is stored on a device that is unavailable, a new copy node is stored-on an available device, and references to that node are updated to reflect its new location on the available device. In addition, when a device that was temporarily unavailable becomes available and attempts to rejoin the set of devices, that device is merged into the system and provided with references to the current copy of the index tree. Furthermore, the index tree may also be traversed to detect and restored any nodes that reside on unavailable devices by storing the nodes on available devices, and updating references to the restored nodes to reflect their new locations on the available devices.
II. MIRRORED INDEX TREE
A. General Tree
[0040] To better understand the mirrored index tree, background information regarding an index tree is now described. FIG. 1 illustrates an example index tree 100 that includes three pieces of data, Data A 110, Data B 120, and Data C 130. Each of the pieces of data includes an index, namely 01, 08, and 24 respectively. FIG. 1 illustrates how the three pieces of data are stored in the tree. The top level of the tree includes two entries, 10 and 20, also referred to as keys or index entries. In some embodiments, the keys are of a fixed or variable size. In this example, if the data's index is less than or equal to 10, the data is stored off of the first branch of the tree; if the data's index is greater than 10 and less than or equal to 20, then the data is stored off of the second branch of the tree; if the data's index is greater than 20, then the data is stored off of the third branch of the tree. Thus, in this embodiment, a top level node 140, also referred to as a root node, covers all possible indexes. It is recognized that a variety of indexing techniques may be used wherein the top level covers other subsets of possible indexes, where other types of indexes are used (e.g., whole numbers, words, letters, etc.).
[0041] In FIG. 1 , Data A's index is 01 which is less than or equal to 10 and less than or equal to 04. Thus, Data A is stored off of the first branch of internal node 150 on leaf node 170. Data B's index is 08 which is less than or equal to 10 and greater than 07. Thus, Data B is stored off of the third branch of internal node 150 on leaf node 180. Data C's index is 24 which is greater than 20 and less than or equal to 46. Thus, Data C is stored off of the first branch of internal node 160 on leaf node 190.
[0042] Index trees that are well known in the art include, for example, binary trees, B trees, B+ trees, B* trees, AVL trees, and so forth. Moreover, operations for searching, reading, updating, inserting nodes, deleting nodes, and balancing an index tree are well known to those of skill in the art.
B. Mirrored Tree
[0043] The systems and methods disclosed herein provide a protected index tree. In one embodiment, the nodes of the index tree are mirrored. One advantage of mirroring the nodes is that if one copy of a node is unavailable, then the other copy of the node may be used instead. In one embodiment, the entire index tree is mirrored the same number of times (e.g., all of the nodes are mirrored two times; all of the nodes are mirrored five times, etc.). In another embodiment, different nodes of the tree may have different levels of mirroring protection. For example, one node may be mirrored two times and another node may be mirrored five times. To maintain the protection level of the index tree, in this embodiment, a node of the index tree is stored using at least the same level of protection as the children that it references. For example, if a leaf node is mirrored two times, then any parent node referencing (e.g., pointing to) that leaf node is also mirrored at least two times.
[0044] FIG. 2 illustrates one embodiment of the index tree of FIG. 1 where the index tree includes different mirroring levels, such that different nodes in the index tree are mirrored a different number of times. Fore example, Data B 120 is stored with a protection level of 3×. Accordingly, the branches of the index tree 140, 150 that lead to Data B 120 are also protected at a protection level of at least 3×.
C. Distributed Storage of the Mirrored Tree
[0045] In one embodiment, copies of a node are stored among a set of devices. For example, in FIG. 2 , one copy of the root node 140 may be stored on a Device A, the second copy of the root node 140 may be stored on a Device B, and the third copy of the root node 140 may be stored on a Device C. Similarly, one copy of a leaf node 180 may be stored on Device B, the second copy of the leaf node 180 may be stored on Device C, and the third copy of the leaf node 180 may be stored on Device D. Accordingly, if one of the devices becomes unavailable (e.g., fails, crashed, becomes disconnected, is taken off line, etc.), then additional copies of the node may be retrieved from the other devices. For example, if Device B disconnects from Device A, Device C, and Device D, copies of the root node 140 are still available on Device A and Device C. Similarly, copies of the leaf node 180 are still available on Device C and Device D.
[0046] In addition, in some embodiments, references to each copy of the root of the index tree are stored on each device. These references will be referred to as a superblock. FIG. 3A illustrates the set of Devices A, B, C, and D that are in communication with each other. Each device includes a superblock that provides the address of each copy of the root node as well as the version of the index tree referenced by the superblock. In the example above, the root node 140 is stored on Device A, Device B, and Device C. Accordingly, Device A, Device B, and Device C of FIG. 3 each have a copy of the root node 140. In the example above, the leaf node 180 is stored in Device B, Device C, and Device D. Accordingly, Device B, Device C, and Device D of FIG. 3 each have a copy of the leaf node 180. It is recognized that the address may be stored in a variety of formats using, for example, device number, address offsets, cylinder numbers, storage unit numbers, cache memory IDs, and so forth. In FIG. 3A , all four of the superblocks are shown as Version 3. Because they are all the same version, the superblocks, in this example, reference the same index tree.
[0047] FIG. 3B illustrates the example of when Device B becomes disconnected from Device A, Device C, and Device D, where copies of the root node 140 are still available on Device A and Device C. Similarly, copies of the leaf node 180 are still available on Device C and Device D.
[0048] FIG. 3C illustrates the example of FIG. 3B after a modification has taken place where the modify operation created a new copy of the root node, to replace the copy of the root node that is not available on Device B. In FIG. 3C , the new copy of the root node is stored on Device D, the superblocks of the available devices, Device A, Device C, and Device D have been updated to reflect that copy 2 of the root node is located on Device D (and not Device B). In addition, the version of the superblocks of Device A, Device C, and Device D have been updated to a new version to reflect that a modification of the superblocks has taken place.
[0049] FIG. 3D illustrates the example of FIG. 3A after Device B has come back online and merged back into the set of devices. Device B's superblock has been modified to reflect that copy 2 of the root node is located on Device D and to include the new version of the superblock. In addition, because the copy of the root node on Device B is no longer referenced, it has been removed from Device B. Also, in this example, there were no attempts to modify the leaf node 180 while Device B was offline. Accordingly, a copy of leaf node 180 remains on Device B.
D. Various Embodiments
[0050] In some embodiments, the index tree is implemented as a modified B* tree. As is well known by those of ordinary skill in the art, a B* tree is a search tree where every node has between ┌m/2┐ and m children, where m>1 is a fixed integer. Nodes are kept ⅔ full by redistributing the contents to fill two child nodes, then splitting them into three nodes. It may be advantageous to use a B* tree since the height, and hence the number of maximum accesses, can be kept small depending on m. As new nodes are added, the B* tree readjusts to keep the height of the tree below a maximum number. In some embodiments, the B* tree is further configured to have variable-sized records, that can be redundantly stored, splits insertion blocks once while they are being filled, and leaves behind a trail of blocks. It will be understood that, although some of the file and logical structures are described in terms of B-trees, various concepts of the present disclosure are not necessarily limited to B-tree applications. Moreover, it is recognized that a variety of data structures known to those of ordinary skill in the art may be used including, for example, other trees, graphs, linked lists, heaps, databases, stacks, and so forth.
[0051] Furthermore, in some embodiments, the index tree is protected using other protection schemes besides or in addition to mirroring. While mirroring is discussed herein, it is recognized that a variety of other protection/correction techniques may be used in addition to or instead of mirroring. For example, the nodes of the index tree may be protected using parity protection, for example, for nodes that are distributed among multiple devices. Moreover, the index tree may include nodes that are not mirrored at all.
[0052] It also is recognized that the term storage device may refer to a variety of devices including for example, a smart storage unit, a disk drive, a server, a non-volatile memory device, a volatile memory device, and so forth. Moreover, the storage device may be locally connected and/or remotely connected to one or more other devices. For example one smart storage unit may include multiple devices. Moreover, a storage device may include multiple memory units including one more volatile memory units and/or one or more non-volatile memory units.
III. OPERATIONS
[0053] Operations for reading, modifying, and restoring a distributed mirrored index tree are set forth below. In addition, an operation for merging in a device that was previously inaccessible is also disclosed.
[0054] A. Reading
[0055] To read data stored in the distributed mirrored index tree, a read process receives the requested data's index. The read process accesses one copy of the root node (e.g., using one of the references from the superblock), and based on the data's index and the keys in the root node, accesses one copy of the node in the next level of the distributed mirrored index tree. The read process then continues using the data's index and the keys in the nodes of the tree to access one copy of the node in the next level of the distributed mirrored index tree. Once the read processes accesses a copy of the leaf node, then the read processes uses the data's index to retrieve the data corresponding to that index.
[0056] Accordingly, if one copy of a node is on a disconnected device, then the read process attempts to access another copy of that node. The read process may be configured to request copies of nodes in a predetermined order based on the devices, to use a round robin technique based on which device was last used, a most recently used technique based on devices that were recently used, a “distance-based” technique placing a preference on local devices rather than remote devices, to use a random technique, and so forth.
[0057] B. Modifying
[0058] To modify data stored in the distributed mirrored index tree, a modify process receives a node to be modified, referred to as the target node. The modify process may also receive the modification that is requested (e.g., to update data, to update reference(s) to other nodes, to remove node, etc.). The modify process traverses the tree to the parent of the target node. The modify process then determines whether all of the copies of the target node are accessible. If so, then the modify process modifies all copies of the target node.
[0059] If one of the copies of the target node is not accessible (e.g., stored on a device that is not in communication with the other devices), then the modify process modifies the available copies of the target node, creates a new copy of the target node, stores the new copy on one of the available devices, and calls the modify process using the parent node.
[0060] Accordingly, the modify process then traverses the tree to the parent of the parent node, determines whether all copies of the parent node are accessible and if so, modifies all of the copies of the parent node to point to the new copy of the target node. If one of the copies of the parent node is not accessible, then the modify process modifies available copies of the parent node, creates a new copy of the parent node, stores the new copy of the parent node on one of the available devices, and calls the modify process of the parent's parent node (e.g., the grandparent of the target node).
[0061] This modify process continues up to the root node if changes to each of the parent nodes are necessary. In one embodiment, the root node acts as a special case since the address of each copy of the root nodes is stored on each device. If one of the copies of the root node are unavailable, then the modify process modifies available copies of the root node, creates a new copy of the root node, stores the new copy of the root node on one of the available devices, and then determines whether there are a quorum of devices that are available. If not, then the modify process does not update the superblocks to point to the new root node. If so, then the modify process modifies the superblocks to point to the new copy of the root node and updates the version of the superblocks.
[0062] The modify process 400 could also include removing nodes, where no changes are made to the target node and no copies of target nodes are made. Instead, the modify process 400 recursively updates the parent node of the node to be removed to reflect that the node has been removed. In other embodiments, the modify process 400 could replace the node to be removed with one more good copies of the node.
[0063] One example of a modify process 400 is illustrated in FIG. 4A . Beginning in a start state 410, the modify process 400 proceeds to block 415. In block 415, the modify process 400 receives a node and a requested modification to the node. The node may be identified using a variety of techniques such as, for example, an identifier, a name, a path, and so forth. In addition, the modification may include, for example, modifying data stored in a leaf node, modifying pointers to children nodes, removing the node from the index tree, and so forth. Proceeding to the next block 420, the modify process 400 accesses the node's parent node. In this example, the parent node is the node that references the node, and the parent of the root node is the superblock. Proceeding to block 425, the modify process 400 determines whether all copies of the node are available. For example, a copy of the node would not be available if the copy was stored on a device that is down. If all copies are available, then the modify process 400 modifies all copies of the node with the requested modification 430 and proceeds to an end state 465. If all copies are not available, the modify process 400 modifies all available copies of the node with the requested modification 435, creates and stores a new copy of the node (or more than one copy if more than one copy is not available) 440 on an available device. It is recognized that if none of the copies are available, the modify process 400 may terminate and return an error.
[0064] Proceeding to block 445, the modify process 400 determines whether the node is the root node. If the node is not the root node, then the modify process 400 proceeds to block 450; if the node is the root node, then the modify process 400 proceeds to block 455.
[0065] In block 450, the modify process 400, recursively calls the modify process to modify the parent node to point to the new copy (or copies) of the node, and proceeds to the end state 465.
[0066] In block 455, the modify process 400 determines whether there is quorum of available devices. In one embodiment, the quorum is a majority of the devices, but it is recognized that in other embodiments, other subsets of the number of devices could be used. If there is not a quorum, then the modify process 400 proceeds to the end state 465. In some embodiments, the modify process 400 may return an error indicating that less than a quorum of the devices are available. If there is a quorum, the modify process 400 proceeds to block 460 and updates the superblocks to point to the new copy (or copies) of the root. In some embodiments, the modify process 400 also updates the superblock to store a new version. It is recognized that in some embodiments, the modify process 400 does not update the superblocks, but sends out commands for each of the devices to update their superblocks and/or to update their versions.
[0067] It is recognized that other embodiments of a modify process 400 may be used. FIG. 4B illustrates an additional embodiment of a modify process 400 that prevents any updating of the root nodes if there is not a quorum. FIGS. 4A and 4B illustrate various embodiments of the modify process 400.
[0068] C. Restoring
[0069] To restore data stored in the distributed mirrored index tree, a restore process traverses the distributed mirrored index tree to find copies of nodes that are stored on unavailable devices and to restore those copies.
[0070] The restore process begins with a copy of the superblock and determines whether all copies of the root node are available. If so, then the superblock retrieves one copy of the root node and determines whether all copies of each of the root nodes′ children are available. If not, then the restore process determines whether there is quorum of available devices. If there is not a quorum, the restore process terminates. If there is a quorum, then the restore process creates and stores a new copy of the missing root node on one of the available devices, and updates the superblocks on all of the available devices to reference the newly created copy of the root node and to update the superblocks' version.
[0071] Next, the restore process proceeds to the next level of the tree, and determines whether all copies of the root's children nodes are available. If not, then the restore process creates and stores missing copies of the root's children. The restore process then proceeds to restore children of the root's children. The restore process continues this for each level of the tree until all nodes, including the leaf nodes, have been traversed.
[0072] 1. Restore Tree Process
[0073] One example of a restore tree process 500 is illustrated in FIG. 5 . Beginning in a start state 510, the restore tree process 500 proceeds to the next block 515. In block 515, the restore tree process 500 obtains a copy of the superblock. Proceeding to the next block 520, the restore tree process 500 determines whether all copies of the root node are available. If so, then the restore tree process 500 proceeds to block 545. If not, then the restore tree process 500 proceeds to block 525.
[0074] In block 525, the restore tree process 500 obtains a copy of the root node. It is recognized that if none of the copies are available, the restore tree process 500 may terminate and/or return an error. In block 530, the restore tree process 500 creates and stores a new copy of the root node (or more than one copy if more than one copy is not available). The restore tree process 500 then determines whether there is quorum of available devices. If there is not a quorum, then the restore tree process 500 proceeds to the end state 550. In some embodiments, the restore tree process 500 may return an error indicating that less than a quorum of the devices is available. If there is a quorum, the restore tree process 500 proceeds to block 540 and updates the superblocks to point to the new copy (or copies) of the root node. In some embodiments, the restore tree process 500 also updates the superblock to store a new version. It is recognized that in some embodiments, the restore tree-process 500 does not update the superblocks, but sends out commands for each of the devices to update their superblocks and/or to update their versions. The restore tree process 500 then proceeds to block 545.
[0075] In block 545, the restore tree process 500 calls a restore node process 600 to restore the root node. In some embodiments, the restore node process 600 is passed the copies of the root node or references to the copies of the root node.
[0076] 2. Restore Node Process
[0077] One example of a restore node process 600 is illustrated in FIG. 6 . Beginning in a start state 610, the restore node process 600 proceeds to the next block 615. In block 615, the restore node process 600 obtains copies of or receives copies of a parent node (or references to the node). For each child of the parent node 620, 650, the restore node process 600 determines whether all copies of the child node are available. If so, then the restore node process 600 proceeds to the next child 620, 650. If not, then the restore node process 600 proceeds to block 630.
[0078] In block 630, the restore node process 600 obtains a copy of the child node. It is recognized that if none of the copies are available, the restore node process 600 may terminate and/or return an error. In block 635, the restore node process 600 creates and stores a new copy of the child node (or more than one copy if more than one copy is not available). Proceeding to the next block 640, the restore node process 600 updates the copies of the parent node to point to the new copy (or copies) of the child node. Proceeding to the next block 645, the restore node process 600 calls a restore process to restore the child node. In some embodiments, the restore process is passed the copies of the child node or references to the copies of the child node. Once the children of the parent node have been traversed and the children nodes have been restored, then the restore node process 600 proceeds to an end state 655.
[0079] It is recognized that the tree may be traversed in a variety of manners and that in other embodiments the tree may be traversed starting with the leaf nodes and/or the tree may be traverses level by level. FIGS. 5 and 6 are meant only to illustrate example embodiments of a restore process.
[0080] D. Merging
[0081] The distributed mirrored index tree may also be used to merge in new devices that were temporarily unavailable, but that have now become available. When a device comes back online, the device may need to access the distributed mirrored index tree. However, the device may have invalid references to copies of the root node of the distributed mirrored index tree. For example, while the device was offline, one of the copies of the root node may have been stored on the down device and may have been modified using the modify process above. Accordingly, a new copy of the root node, with the modified data may have been created and updated and stored on an available device. In addition, the superblocks' references to copies of the root node may have been modified to reference the new copy of the root node instead of the copy that was stored on the down device.
[0082] A merge process may be used to compare the version of a device's superblock with versions of the other devices. If the version is the same, then the device's superblock is current. If the device's version is lower than the versions of the other devices, then the device's superblock is updated to point to the same copies of the root node as devices with the highest version. In addition, the device's superblock device is updated to the highest version.
[0083] One example of a merge process 700 is illustrated in FIG. 7 . Beginning in a start state 710, the merge process 700 proceeds to block 715. In block 715, the merge process 700 obtains the version of the superblock for the device that is merging into the set of other devices. Proceeding to the next block, 720, the merge process 700 queries the other devices for the versions in their superblocks. Proceeding to the next block 725, the merge process 700 determines the highest version. In other embodiments, the merge process may also determine whether there is a quorum of nodes that have the highest version. If not, then the merge process 700 may return an error.
[0084] Proceeding to the next block 730, the merge process 700 determines whether the device's version is less than the highest version. If not, then the merge process 700 proceeds to an end state 750. If so, then the merge process updates the device's superblock to point to the same copies of the root node as pointed to by a superblock with the highest version 735. Proceeding to the next block 740, the merge process 700 updates the superblock's version to the highest version.
[0085] The version may be represented using a variety of techniques such as, for example, an integer, a decimal, a letter, a word, and so forth.
[0086] FIG. 7 illustrates one embodiment of a merge process 700 and it is recognized that other embodiments of a merge process 700 may be used.
IV. DISTRIBUTED SYSTEM
[0087] FIG. 8A illustrates one embodiment of a distributed system 800 having an index tree management module 820 in communication with a set of devices 810. It is recognized that the index tree management module 820 may be located apart from the set of devices 810 and/or may be located on one or more of the devices 810, as illustrated in FIG. 8B . In other embodiments, the index tree management module 820 may be spread among one or more of the devices 810.
[0088] The index tree management module 820 and the devices 810 may communicate using a variety of communication techniques that are well known in the art. Such communication may include local communication, remote communication, wireless communication, wired communication, or a combination thereof.
[0089] The exemplary devices include a superblock 812 as well as a set of index tree nodes 814. As illustrated each device may include a different number of index tree nodes or may include the same number of index tree nodes. The superblock and/or index tree nodes may be stored on disks or other non-volatile memory on the device 810 and/or in RAM or other volatile memory on the device 810. The distributed system 800 is not limited to a particular type of memory. In addition, the distributed system 800 may include devices that do not include any superblocks and/or any index tree nodes.
[0090] In some embodiments, the distributed system 800 may be accessible by one or more other systems, modules, and/or users via various types of communication. Such communication may include, for example, the Internet, a private network for a hospital, a broadcast network for a government agency, an internal network of a corporate enterprise, an intranet, a local area network, a wide area network, and so forth. It is recognized that the distributed system 800 may be used in a variety of environments in which data is stored. For example, the distributed system 800 may be used to stored records in a database, content data, metadata, user account data, and so forth.
[0091] It is also recognized that in some embodiments, the systems and methods may be implemented as a single module and/or implemented in conjunction with a variety of other modules and the like. Moreover, the specific implementations described herein are set forth to illustrate, and not to limit, the present disclosure.
V. SAMPLE INDEX TREE NODES
[0092] FIGS. 9A , 9B, and 9C illustrate example embodiments of a superblock 900, an inner node 910, and a leaf node 930. In various embodiments, these nodes can have redundant copies in a manner described herein.
[0093] A. Superblock
[0094] FIG. 9A illustrates one embodiment of a superblock 900 that can be configured to provide, among others, the functionality of pointing to the copies of the root node for an index tree. In one embodiment, the superblock 900 points to an index tree by pointing to (e.g., storing the device number and address of) copies of the root node. The exemplary superblock 900 includes a header section 902, followed by a listing of pointers 904 to the one or more copies of the root node. The exemplary list of pointers includes baddr1 to baddrN. Thus, the pointer baddr1 points to the first copy of the root node, baddr2 to the second copy of the root node, and so on. In one embodiment, unused pointers are stored as zeroes or NULL values and placed at the end of the listing 904. For example, if the superblock 200 points to two copies of a root node, then the pointers baddr1 and baddr2 would be positioned at the beginning of the listing 904, and the remainder of the listing 904 would be zeroed out.
[0095] In other embodiments, the superblock 900 may be configured to point to more than one index tree.
[0096] As further shown in FIG. 9A , the header section 902 can include version information that indicates how current the index tree is (e.g., version information). The header section 902 can also include information about the height of the index trees that are pointed to by the pointers 904. A height of zero indicates that the superblock 900 does not point to any index tree. A height of one indicates that the superblock 900 points directly to copies of leaf blocks (e.g., there are no inner blocks). A height of n>1 indicates that there are n−1 levels of inner blocks. It is recognized that the superblock 900 may include additional and/or other data such as, for example, the name of the index tree(s), the date the superblock 900 was last updated, the number of devices required for a quorum, the date the superblock 900 was created, permission information indicating which devices and/or users have permission to read, write, or delete the superblock 900, and so forth.
[0097] As set forth above, in one embodiment, a copy of the superblock 900 is stored on each device of the distributed system.
[0098] B. Inner Node
[0099] FIG. 9B illustrates one embodiment of an inner node 910 that includes a header section 912 followed by a listing of index entries 714 (shown as key1, key2, . . . , keyn) and related offset values 920. The offset values 920 point to pointer entries 918 that relate to the index entries 914. The pointer entries 918 point to leaf nodes or to another level of inner nodes.
[0100] Inner nodes 910 provide mappings to values between index entries 914 using pointer entries 918. For example, offset0 points to the address of the node for values less than key1; offset1 points to the address of the node for index entries greater than or equal to key1 and less than key2; offset2 points to the address of the node for index entries greater than or equal to key2 and less than key3; and so forth.
[0101] The number of pointer entries for each offset depends on the number of mirrored copies of that node. For example, if child node is mirrored two times, then any offset pointing to that node will have at least two pointer entries related to that offset. Similarly, if a child node is mirrored three times, then any offset pointing to that node will have at least three pointer entries related to that offset. In the exemplary inner node 910, offset0 points to baddr01, baddr02, and baddr03 signifying that there are three copies of the child node located at baddr01, baddr02, and baddr03; the node is mirrored three times (3×). Similarly, offset1 points to baddr11 and baddr12 signifying that there are two copies of the second child node located at baddr11 and baddr12; that node is mirrored two times (2×). Accordingly, the inner nodes provide information as to where copies of their children nodes are stored.
[0102] In one embodiment, the index entries 914 and the offsets 920 are arranged in an increasing order beginning from the top of the inner node 910. The pointer entries 918 corresponding to the offsets 920 are arranged beginning from the bottom of the inner node 910. Thus, a free space 916 can exist between the index entries 914 and the pointer entries 918. Such an arrangement and the free space 916 provide for easy addition of new index entries 914. For example, if keyn+1 is to be added, it can be inserted below the last entry (keyn) of the index entries 914. A corresponding pointer entry can then be inserted above the last entry. The free space 916 accommodates such addition, and the existing index entries and the pointer blocks are not disturbed. This embodiment allows referenced nodes to be protected at different levels allowing for the addition of multiple pointer entries 918 for each offset 220. In addition, it allows the index tree to be rebalanced such that if additional index entries 214 are needed to balance the tree, then they can be added.
[0103] As further shown in FIG. 9B , the header 912 can include information similar to that of the inner node 910 discussed above The header 912 can also indicate the number of index entries 914 (e.g., key_count). The header 912 can also indicate the maximum protection “mp” (the maximum redundancy) for the index entries 214 (and the corresponding pointer entries). The header 912 can also indicate how many (e.g., mp_count) index entries (e.g., child nodes) have the maximum protection. In other embodiments, the header 912 may also include information about the protection level of each of the child nodes in addition to or instead of the maximum protection level. In other embodiments, the header 912 may include information about a subset of the protection levels and counts related to those protection levels. The information about the maximum protection and the count that can be used allow for variable protection in the index tree as disclosed in U.S. patent application entitled “Systems and Methods for Providing Variable Protection in an Indexing System,” filed concurrently herewith, which is hereby incorporated by reference herein in its entirety.
[0104] Moreover, it is recognized that the inner nodes 910 may include additional and/or other data, such as, for example, the date the inner node 910 was last updated, the date the inner node 910 was created, permission information indicating which devices and/or users have permission to read, write, or delete the inner node 910, and so forth. It is also recognized that the information discussed above may be stored in the header 912 or in other areas of the inner node 910.
[0105] In one embodiment, the inner node 910 as a whole constitutes a fixed amount of data. Thus, the foregoing arrangement of the index entries 914 and the pointer entries 918, in conjunction with the free space 916, allows for addition of new data without altering the existing structure. In one embodiment, the inner node 910 is 8 kB in size. It is recognized, however, that the inner node may be of a variety of sizes.
[0106] C. Leaf Node
[0107] FIG. 9C illustrates one embodiment of the leaf node 930 having a header 932 and a listing of leaf index entries 934. The leaf index entries 934 (key1, key2 . . . , keyn) have corresponding offsets 940, and are arranged in a manner similar to that of the inner node 910 described above. In one embodiment, the leaf nodes 930 are at the bottom level of the tree, with no lower levels. Thus, the offsets 940 for the leaf index entries 934 points to data 938 for the corresponding index entry 934. The exemplary leaf node includes n index entries 934, where key1 corresponds to offset1, which points to two copies of the data that correspond to key1, where the two copies of the data are stored at data11 and data12. The index entries may correspond to a variety of data. For example, the data 938 may include records in a database, user account information, version data, metadata, addresses to other data, such as metadata data structures for files and directories of the distributed file system, and so forth. For example, offset1 points to the address block having example two copies of the data (data11 and data12), which may be, for example, two copies physical addresses of a metadata structure for a file that is distributed within the distributed system.
[0108] In one embodiment, the arrangement of the leaf index entries 934 and the data 938, with a free space 936, is similar to that of the inner node 910 described above in reference to FIG. 9B . The header 932 may also include similar information as that of the inner node 910.
[0109] In one embodiment, the leaf block 930 as a whole constitutes a fixed amount of data. In one embodiment, the leaf block 930 is 8 kB in size. It is recognized, that the leaf block 930 may be a variety of sizes.
IV. EXAMPLE ENVIRONMENTS
[0110] The following provides example environments in which a distributed mirrored index tree may be used. It is recognized that the systems and methods disclosed herein are not limited to such example environments and that such examples are only meant to illustrate embodiments of the invention.
[0111] A. Employee Database System
[0112] FIG. 10 illustrates an example distributed mirrored index tree 1000 for storing employee database records, where the records are sorted by last name. For example, the index value for employee Phil Ader is “Ader” and the index value for Jan Saenz is “Saenz.” The exemplary index tree 1000 includes nodes that are mirrored two times.
[0113] As an example, if a request to modify Kaye Byer's name to be “Kay” instead of “Kaye,” following the modify process disclosed herein, the modify process 400 would obtain a copy of node 1020a or 1020b and determine whether both 1040a and 1040b were on live devices. If, for example, 1040b was stored on a failed device, the modify process 400 would make the change to 1040a, copy the modified 1040a to create a new copy of 1040b stored on an available device, and then check to see if 1020a and 1020b were both on live devices. If so, then the modify process 400 would update the pointers in 1020a to point to the new 1040b and update the pointers in 1020b to point to the new 1040b.
[0114] FIG. 11 illustrates an example leaf node 1100 that corresponds to node 1040a. The exemplary leaf node 1100 includes a header 1152 noting that the node is a leaf node, the node is version 5, the number of entries is 2, the maximum protection is 1×, and the number of entries is 2. The entries 1134 include Ader and Byer whose corresponding offsets 1140 point to the respective data values “Ader, Phil” and “Byer, Kay” 1138.
[0115] B. Intelligent Distributed File System
[0116] As another example, in one embodiment, the systems and methods may be used with an intelligent distributed file system as disclosed in U.S. patent application Ser. No. 10/007,003, entitled “System and Method for Providing a Distributed File System Utilizing Metadata to Track Information About Data Stored Throughout the System,” filed Nov. 9, 2001, which claims priority to Application No. 60/309,803 filed Aug. 3, 2001, which is hereby incorporated by reference herein in its entirety.
[0117] In one embodiment, the intelligent distributed file system uses metadata data structures to track and manage detailed information about files and directories in the file system. Metadata for a file may include, for example, an identifier for the file, the location of or pointer to the file's data blocks as well as the type of protection for each file, or each block of the file, the location of the file's protection blocks (e.g., parity data, or mirrored data). Metadata for a directory may include, for example, an identifier for the directory, a listing of the files and subdirectories of the directory as well as the identifier for each of the files and subdirectories, as well as the type of protection for each file and subdirectory. In other embodiments, the metadata may also include the location of the directory's protection blocks (e.g., parity data, or mirrored data). The metadata data structures are stored in the intelligent distributed file system.
[0118] 1. Distributed Mirrored Index Trees
[0119] In one embodiment, the intelligent distributed file system uses a distributed mirrored index tree to map the identifiers for a file or directory to the actual address of the file's or directory's metadata data structure. Thus, as metadata data structures are moved to different smart storage units or different address locations, only the index tree entries need needs to be updated. Other metadata data structures that reference that file or directory need not be updated to reflect the new location. Instead, the metadata data structures that reference that file or directory just use the identifier of that file or directory.
[0120] FIG. 12 illustrates one embodiment of a distributed mirrored index tree 1200 that stores addresses of metadata data structures, or nodes, that are indexed by integers. The root node 1210 includes two index entries 10 and 20. Accordingly, entries with index values less than 10 are stored off the first branch of the root node 1210, entries with index values greater than or equal to 10 and less than 20 are stored off the second branch of the root node 1210, and entries with index values greater than or equal to 20 are stored off the third branch of root node 1210.
[0121] Similarly, inner node 1220 has index values 3 and 7. Accordingly, entries with index values less than 3 are stored off the first branch of the inner node 1220, entries with index values greater than or equal to 3 and less than 7 are stored off the second branch of the inner node 1220, and entries with index values greater than or equal to 7 (but presumably less than 10) are stored off the third branch of inner node 1220.
[0122] In addition, leaf node 1250 has index values 1 and 2. Accordingly, entries with index values of 1 or 2 are stored in the leaf node 1250. Similarly, entries with index values of 3, 4, 5, or 6 are stored in the leaf node 1260, and entries with index values of 7, 8, or 9 are stored in the leaf node 1270.
[0123] The exemplary index tree 1200 also maintains the protection level of the index tree. For example, leaf node 1250 is mirrored two times and root node 1210 is mirrored three times.
[0124] 2. Example Leaf Node
[0125] FIG. 13 illustrates an example leaf node 1300 that corresponds to leaf node 1250. The exemplary leaf node 1300 includes a header 1352 noting that the node is a leaf node, the node is version 2.1, the number of entries is 2, the maximum protection is 2×, and the number of entries is 2. The entries 1334 include 01 and 02 whose corresponding offsets 1340 point to the respective copies of the address entries “addrA” and “addrB” 1338. In this example, “addrA” is the address of the metadata data structure with identifier 01.
[0126] Furthermore, as discussed above, FIGS. 11 and 13 illustrate examples of how the leaf node may be stored. Various configurations of the superblocks, inner nodes, and leaf nodes may be used.
V. CONCLUSION
[0127] Although the above-disclosed embodiments have shown, described, and pointed out the fundamental novel features of the invention as applied to the above-disclosed embodiments, it should be understood that various omissions, substitutions, and changes in the form of the detail of the devices, systems, and/or methods shown may be made by those skilled in the art without departing from the scope of the invention. Consequently, the scope of the invention should not be limited to the foregoing description, but should be defined by the appended claims.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A computer-implemented method of maintaining protection levels for nodes of a distributed mirrored indexed tree while modifying data stored in the nodes, the method comprising:
receiving a request to modify a target node of a mirrored index data structure organized in a hierarchy and stored among a plurality of storage devices, the mirrored index data structure comprising:
a root node;
at least one copy of the root node, wherein the root node and the copy of the root node are stored on different storage devices;
a plurality of nodes beneath the root node in the hierarchy, each of the nodes referencing one or more index nodes or indexed data, the plurality of nodes including the target node; and
at least one copy of each node of the plurality of nodes stored on one of the plurality of storage devices, wherein each node of the plurality of nodes and its respective copy are stored on different storage devices;
accessing, by a computer processor, a first reference to the target node and a second reference to a copy of the target node, the first reference and the second reference stored on a parent node of the target node, wherein the parent node is the root node or one of the plurality of nodes and is above the target node in the hierarchy, wherein the target node is stored on a first storage device of a plurality of storage devices, the copy of the target node is stored on a second storage device of the plurality of storage devices, the second storage device different from the first storage device;
determining, by a computer processor, whether the second storage device storing the copy of the target node is unavailable;
accessing, by a computer processor, the target node;
modifying, by a computer processor, the target node based on the request;
if the second storage device is unavailable, storing, by a computer processor, a copy of the modified target node on a third storage device of the plurality of storage devices, wherein the third storage device is available and is different from the first storage device and the second storage device, and updating, by a computer processor, the second reference; and
if the second storage device is available, updating, by a computer processor, the copy of the target node.
2. The computer-implemented method of claim 1 wherein updating the second reference comprises recursively applying, by a computer processor, the method of claim 1 to modify one or more references in one or more ancestor nodes of the target node, the ancestor nodes among the plurality of nodes, above the target node in the hierarchy, and including at least the parent node, one or more copies of the parent node, any grandparent nodes of the target node, and any copies of any grandparent nodes.
3. The computer-implemented method of claim 1 wherein updating the second reference comprises:
updating, by a computer processor, the parent node to reference the copy of the modified target node stored on the third storage device and to not reference the copy of the target node stored on the second storage device; and
updating, by a computer processor, any copies of the parent node to reference the copy of the modified target node stored on the third storage device and to not reference the copy of the target node stored on the second storage device.
4. The computer-implemented method of claim 3, further comprising:
determining, by a computer processor, that the parent node is the root node;
determining that a copy of the parent node is stored on an unavailable device;
storing a copy of the updated parent node on one of the plurality of storage devices that is available and that is different from the device on which the parent node is stored;
determining, by a computer processor, whether there is a quorum of available storage devices among the plurality of storage devices that are available; and
if there is a quorum, updating, by a computer processor, data stored on each of the plurality of devices to reference the copy of the updated parent node stored on the available third device and to not reference the copy of the parent node stored on the unavailable storage device.
5. The computer-implemented method of claim 1 wherein updating the second reference comprises recursively applying, by a computer processor, the method of claim 1 to modify one or more references in one or more ancestor nodes of the target node, the ancestor nodes among the plurality of nodes, above the target node in the hierarchy, and including at least the parent node, one or more copies of the parent node, any grandparent nodes of the target node, and any copies of any grandparent nodes, wherein the method of claim 1 is recursively applied, by a computer processor, to the one or more ancestor nodes of the target node until it is determined, by a computer processor, that the one or more ancestor nodes and each copy of the one or more ancestor nodes are stored on available storage devices.
6. The computer-implemented method of claim 1 wherein the distributed mirrored index tree is implemented as at least one of a balanced tree, a hash table, and a linked list.
7. A computer-implemented method of restoring mirrored nodes of a distributed indexed tree, the method comprising:
accessing, by a computer processor, a first reference to a child node of a mirrored index data structure organized in a hierarchy and stored among a plurality of drives, the mirrored index data structure comprising:
a root node;
at least one copy of the root node, wherein the root node and the copy of the root node are stored on different drives;
a plurality of nodes beneath the root node in the hierarchy, each of the plurality of nodes referencing one or more index nodes or indexed data, the plurality of nodes including the child node; and
at least one copy of each node of the plurality of nodes stored on one of the plurality of drives, wherein each node of the plurality of nodes and its respective copy are stored on different drives;
accessing, by a computer processor, a second reference to a copy of the child node, the child node stored on a first drive of a plurality of drives and the copy of the child node stored on a different second drive of the plurality of drives, the first reference and the second reference stored in a parent node of the child node, wherein the parent node is the root node or one of the plurality of nodes and is above the child node in the hierarchy;
determining, by a computer processor, whether the second drive on which the copy of the child node is stored is unavailable; and
if the second drive is unavailable, storing, by a computer processor, a new copy of the child node on an available third drive of the plurality of drives, the third drive different than the first drive and the second drive, and updating, by a computer processor, the second reference.
8. The computer-implemented method of claim 7 wherein updating the second reference comprises recursively applying, by a computer processor, the method of claim 7 to modify one or more references in one or more ancestor nodes of the child node and to restore ancestor nodes of the child node and copies of the ancestor nodes of the child node which are stored on unavailable drives, the ancestor nodes among the plurality of nodes, above the child node in the hierarchy, and including at least the parent node, one or more copies of the parent node, any grandparent nodes of the child node, and any copies of the grandparent nodes.
9. The computer-implemented method of claim 7 further comprising:
accessing a third reference to a grandchild node stored on the plurality of drives and a fourth reference to a copy of the grandchild node stored on the plurality of drives, the grandchild node beneath the child node in the hierarchy and the copy of the grandchild node stored on different drives, the third reference and the fourth reference stored in the child node;
determining whether the drive on which the copy of the grandchild node is stored is unavailable; and
if the drive on which the copy of the grandchild node is stored is unavailable, storing a new copy of the grandchild node on an available drive of the plurality of drives, the new copy of the grandchild node and the grandchild node stored on different drives, and updating the fourth reference to reference the new copy of the grandchild node stored on the available drive instead of the copy of the grandchild node stored on the unavailable drive.
10. The computer-implemented method of claim 7 wherein the child node is an indexed node in a distributed mirrored index tree, the distributed mirrored index tree implemented as at least one of a balanced tree, a hash table, and a linked list.
11. A distributed system comprising:
a plurality of storage units;
a balanced, mirrored index tree stored among the plurality of storage units, the balanced, mirrored index tree organized in a hierarchy and comprising:
a root node stored on one of the plurality of storage units;
a copy of the root node stored on one of the plurality of storage units, wherein the root node and the copy of the root node are stored on different storage units;
a plurality of nodes beneath the root node in the hierarchy, each of the nodes stored on one of the plurality of storage units; and
a copy of each node of the plurality of nodes stored on one of the plurality of storage units, wherein each node of the plurality of nodes and its respective copy are stored on different storage units;
wherein each of the plurality of storage units comprises one or more memory devices, at least one executable software module stored on the one or more memory devices, a processor configured to execute the at least one executable software module, a first index tree reference referencing the root node and a second index tree reference referencing the copy of the root node, the first index tree reference and the second index tree reference stored on the one or more memory devices of each of the plurality of storage units, and
wherein the at least one executable software module comprises a modify module configured to:
identify a target node of the plurality of nodes to be modified;
determine that a copy of the target node is stored on an unavailable storage unit;
modify the target node;
store a copy of the modified target node on one of the plurality of storage units that is available and that is different from the storage unit that stores the target node; and
update a parent node of the target node to reference the copy of the modified target node instead of the copy of the target node, wherein the parent node is the root node or one of the plurality of nodes and is above the target node in the hierarchy.
12. The distributed system of claim 11, wherein the at least one executable software module further comprises a restore module configured to:
for each child node of the parent node,
determine that one copy of the child node is located on an unavailable storage unit;
retrieve the child node from an available storage unit;
initiate the storage of a new copy of the child node on an available storage unit that is different from the storage unit on which the child node is stored;
initiate the updating of the parent node and copies of the parent node to reference the new copy of the child node instead of the copy of the child node.
13. The distributed system of claim 11, the plurality of storage units further comprising a version value stored on the one or more memory devices, wherein the at least one executable software module further comprises a merge module configured to:
receive a first request from a first storage unit to merge into the plurality of storage units, the first storage unit configured to store a first version value;
query the plurality of storage units for their corresponding version values;
determine a highest version value from the version values and determine which storage unit stores the highest version value;
determine whether the first version value is lower than the highest version value; and
if the first version value is lower than the highest version value,
update the first version value to be the same as the highest version value;
update the first index tree reference of the first storage unit to reference the same root node that is referenced by the first index tree reference of the storage unit storing the highest version value; and
update the second index tree reference of the first storage unit to reference the same copy of the root node that is referenced by the second index tree reference of the storage unit storing the highest version value.
14. The distributed system of claim 11 wherein the balanced index tree is implemented as at least one of a balanced tree, a hash table, and a linked list.
15. The computer-implemented method of claim 3 wherein updating the second reference further comprises:
determining that a copy of the parent node is stored on an unavailable device;
storing a copy of the modified parent node on one of the plurality of devices that is available and that is different from the device on which the parent node is stored;
accessing a grandparent node of the target node, the grandparent node including references to the parent node and to the copy of the parent node;
modifying the grandparent node to reference the copy of the modified parent node instead of the copy of the parent node;
accessing a copy of the grandparent node, the copy of the grandparent node stored on a device that is different from the device on which the grandparent node is stored; and
modifying the copy of the grandparent node to reference the copy of the modified parent node instead of the copy of the parent node.
16. The computer-implemented method of claim 3 wherein updating the second reference further comprises:
determining that a copy of the parent node is stored on an unavailable device;
storing a copy of the modified parent node on one of the plurality of devices that is available and that is different from the device on which the parent node is stored;
accessing a grandparent node of the target node, the grandparent node including references to the parent node and to the copy of the parent node;
modifying the grandparent node to reference the copy of the modified parent node instead of the copy of the parent node;
determining that a copy of the grandparent node is stored on an unavailable device;
storing a copy of the modified grandparent node on one of the plurality of devices that is available and that is different from the device on which the grandparent node is stored;
accessing a root node of the target node, the root node including references to the grandparent node and to the copy of the grandparent node,
modifying the root node to reference the copy of the modified grandparent node instead of the copy of the grandparent node;
accessing a copy of the root node, the copy of the root node stored on a device that is different from the device on which the root node is stored;
modifying the copy of the root node to reference the copy of the modified grandparent node instead of the copy of the grandparent node.
17. The computer-implemented method of claim 3 wherein updating the second reference further comprises:
determining that a copy of the parent node is stored on an unavailable device;
storing a copy of the modified parent node on one of the plurality of devices that is available and that is different from the device on which the parent node is stored;
accessing a grandparent node of the target node, the grandparent node including references to the parent node and to the copy of the parent node;
modifying the grandparent node to reference the copy of the modified parent node instead of the copy of the parent node;
determining that a copy of the grandparent node is stored on an unavailable device;
storing a copy of the modified grandparent node on one of the plurality of devices that is available and that is different from the device on which the grandparent node is stored;
accessing a root node of the target node, the root node including references to the grandparent node and to the copy of the grandparent node,
modifying the root node to reference the copy of the of the copy of the modified grandparent node instead of the copy of the grandparent node;
determining that a copy of the root node is stored on an unavailable device; and
storing a copy of the modified root node on one of the plurality of devices that is available and that is different from the device on which the root node is stored,
accessing a superblock node of the target node, the superblock node including references to the root node and to the copy of the root node,
determining whether there is a quorum among the plurality of devices that are available;
if there is a quorum, updating the superblock to reference the copy of the modified root node instead of the copy of the root node and storing an updated superblock version of the distributed mirrored index tree.
18. The computer-implemented method of claim 17 wherein updating the superblock further comprises instructing other devices in the plurality of devices to reference the copy of the modified root node instead of the copy of the root node and to store the updated superblock version of the distributed mirrored index tree.
19. A computer-readable storage device including a set of instructions that causes a computer to perform the method of computer-implemented method of claim 1.
20. A computer-readable storage device including a set of instructions that causes a computer to perform the method of computer-implemented method of claim 7.
21. The distributed system of claim 11, wherein the modify module is further configured to apply the modify module using the parent of the target node as the target node.
22. The distributed system of claim 12, wherein the restore module is further configured to apply the restore module using the parent of the parent node as the parent node.
23. The computer-implemented method of claim 11, wherein the plurality of nodes comprises leaf nodes comprising address data and inner nodes comprising references to leaf nodes or other inner nodes.
Patent Citations (367)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5163131(A) | 1992-11-01 | Row et al. | Applicant |
| US5181162(A) | 1993-01-01 | Smith et al. | Applicant |
| US5212784(A) | 1993-05-01 | Sparks | Examiner |
| US5230047(A) | 1993-07-01 | Frey et al. | Examiner |
| US5251206(A) | 1993-10-01 | Calvignac et al. | Applicant |
| US5258984(A) | 1993-11-01 | Menon et al. | Applicant |
| US5329626(A) | 1994-07-01 | Klein et al. | Applicant |
| US5359594(A) | 1994-10-01 | Gould et al. | Applicant |
| US5403639(A) | 1995-04-01 | Belsan et al. | Applicant |
| US5459871(A) | 1995-10-01 | Van Den Berg | Applicant |
| US5481699(A) | 1996-01-01 | Saether | Applicant |
| US5548724(A) | 1996-08-01 | Akizawa et al. | Applicant |
| US5548795(A) | 1996-08-01 | Au | Applicant |
| US5568629(A) | 1996-10-01 | Gentry et al. | Applicant |
| US5596709(A) | 1997-01-01 | Bond et al. | Applicant |
| US5606669(A) | 1997-02-01 | Bertin et al. | Examiner |
| US5612865(A) | 1997-03-01 | Dasgupta | Applicant |
| US5649200(A) | 1997-07-01 | Leblang et al. | Applicant |
| US5657439(A) | 1997-08-01 | Jones et al. | Applicant |
| US5668943(A) | 1997-09-01 | Attanasio et al. | Applicant |
| US5680621(A) | 1997-10-01 | Korenshtein | Applicant |
| US5694593(A) | 1997-12-01 | Baclawski | Applicant |
| US5696895(A) | 1997-12-01 | Hemphill et al. | Examiner |
| US5734826(A) | 1998-03-01 | Olnowich et al. | Applicant |
| US5754756(A) | 1998-05-01 | Watanabe et al. | Applicant |
| US5761659(A) | 1998-06-01 | Bertoni | Applicant |
| US5774643(A) | 1998-06-01 | Lubbers et al. | Applicant |
| US5799305(A) | 1998-08-01 | Bortvedt et al. | Applicant |
| US5805578(A) | 1998-09-01 | Stirpe et al. | Applicant |
| US5805900(A) | 1998-09-01 | Fagen et al. | Applicant |
| US5806065(A) | 1998-09-01 | Lomet | Applicant |
| US5822790(A) | 1998-10-01 | Mehrotra | Applicant |
| US5862312(A) | 1999-01-01 | Mann | Applicant |
| US5870563(A) | 1999-02-01 | Roper et al. | Applicant |
| US5878410(A) | 1999-03-01 | Zbikowski et al. | Applicant |
| US5878414(A) | 1999-03-01 | Hsiao et al. | Applicant |
| US5884046(A) | 1999-03-01 | Antonov | Applicant |
| US5884098(A) | 1999-03-01 | Mason, Jr. | Applicant |
| US5884303(A) | 1999-03-01 | Brown | Applicant |
| US5890147(A) | 1999-03-01 | Peltonen et al. | Applicant |
| US5917998(A) | 1999-06-01 | Cabrera et al. | Applicant |
| US5933834(A) | 1999-08-01 | Aichelen | Applicant |
| US5943690(A) | 1999-08-01 | Dorricott et al. | Applicant |
| US5966707(A) | 1999-10-01 | Van Huben et al. | Applicant |
| US5996089(A) | 1999-11-01 | Mann | Applicant |
| US6000007(A) | 1999-12-01 | Leung et al. | Applicant |
| US6014669(A) | 2000-01-01 | Slaughter et al. | Applicant |
| US6021414(A) | 2000-02-01 | Fuller | Applicant |
| US6029168(A) | 2000-02-01 | Frey | Applicant |
| US6038570(A) | 2000-03-01 | Hitz et al. | Applicant |
| US6044367(A) | 2000-03-01 | Wolff | Applicant |
| US6052759(A) | 2000-04-01 | Stallmo et al. | Applicant |
| US6055543(A) | 2000-04-01 | Christensen et al. | Applicant |
| US6055564(A) | 2000-04-01 | Phaal | Applicant |
| US6070172(A) | 2000-05-01 | Lowe | Applicant |
| US6081833(A) | 2000-06-01 | Okamoto et al. | Applicant |
| US6081883(A) | 2000-06-01 | Popelka et al. | Applicant |
| US6108759(A) | 2000-08-01 | Orcutt et al. | Applicant |
| US6117181(A) | 2000-09-01 | Dearth et al. | Applicant |
| US6122754(A) | 2000-09-01 | Litwin et al. | Applicant |
| US6138126(A) | 2000-10-01 | Hitz et al. | Applicant |
| US6154854(A) | 2000-11-01 | Stallmo | Applicant |
| US6173374(B1) | 2001-01-01 | Heil et al. | Applicant |
| US6202085(B1) | 2001-03-01 | Benson et al. | Applicant |
| US6209059(B1) | 2001-03-01 | Ofer et al. | Applicant |
| US6219693(B1) | 2001-04-01 | Napolitano et al. | Applicant |
| US6279007(B1) | 2001-08-01 | Uppala | Applicant |
| US6321345(B1) | 2001-11-01 | Mann | Applicant |
| US6334168(B1) | 2001-12-01 | Islam et al. | Applicant |
| US6353823(B1) | 2002-03-01 | Kumar | Applicant |
| US6384626(B2) | 2002-05-01 | Tsai et al. | Applicant |
| US6385626(B1) | 2002-05-01 | Tamer et al. | Applicant |
| US6393483(B1) | 2002-05-01 | Latif et al. | Applicant |
| US6397311(B1) | 2002-05-01 | Capps | Applicant |
| US6405219(B2) | 2002-06-01 | Saether et al. | Examiner |
| US6408313(B1) | 2002-06-01 | Campbell et al. | Applicant |
| US6415259(B1) | 2002-07-01 | Wolfinger et al. | Applicant |
| US6421781(B1) | 2002-07-01 | Fox et al. | Applicant |
| US6434574(B1) | 2002-08-01 | Day et al. | Applicant |
| US6449730(B2) | 2002-09-01 | Mann | Applicant |
| US6453389(B1) | 2002-09-01 | Weinberger et al. | Applicant |
| US6457139(B1) | 2002-09-01 | D'Errico et al. | Applicant |
| US6463442(B1) | 2002-10-01 | Bent et al. | Applicant |
| US6496842(B1) | 2002-12-01 | Lyness | Applicant |
| US6499091(B1) | 2002-12-01 | Bergsten | Examiner |
| US6502172(B2) | 2002-12-01 | Chang | Applicant |
| US6502174(B1) | 2002-12-01 | Beardsley et al. | Applicant |
| US6523130(B1) | 2003-02-01 | Hickman et al. | Applicant |
| US6526478(B1) | 2003-02-01 | Kirby | Applicant |
| US6546443(B1) | 2003-04-01 | Kakivaya et al. | Applicant |
| US6549513(B1) | 2003-04-01 | Chao et al. | Applicant |
| US6557114(B2) | 2003-04-01 | Mann | Applicant |
| US6567894(B1) | 2003-05-01 | Hsu et al. | Applicant |
| US6567926(B2) | 2003-05-01 | Mann | Applicant |
| US6571244(B1) | 2003-05-01 | Larson | Applicant |
| US6571349(B1) | 2003-05-01 | Mann | Applicant |
| US6574745(B2) | 2003-06-01 | Mann | Applicant |
| US6594655(B2) | 2003-07-01 | Tal et al. | Applicant |
| US6594660(B1) | 2003-07-01 | Berkowitz et al. | Applicant |
| US6594744(B1) | 2003-07-01 | Humlicek et al. | Applicant |
| US6598174(B1) | 2003-07-01 | Parks et al. | Applicant |
| US6618798(B1) | 2003-09-01 | Burton et al. | Applicant |
| US6631411(B1) | 2003-10-01 | Welter et al. | Applicant |
| US6658554(B1) | 2003-12-01 | Moshovos et al. | Applicant |
| US6662184(B1) | 2003-12-01 | Friedberg | Applicant |
| US6671686(B2) | 2003-12-01 | Pardon et al. | Applicant |
| US6671704(B1) | 2003-12-01 | Gondi et al. | Applicant |
| US6687805(B1) | 2004-02-01 | Cochran | Applicant |
| US6725392(B1) | 2004-04-01 | Frey et al. | Examiner |
| US6732125(B1) | 2004-05-01 | Autrey et al. | Applicant |
| US6742020(B1) | 2004-05-01 | Dimitroff et al. | Applicant |
| US6748429(B1) | 2004-06-01 | Talluri et al. | Applicant |
| US6801949(B1) | 2004-10-01 | Bruck et al. | Applicant |
| US6848029(B2) | 2005-01-01 | Coldewey | Applicant |
| US6856591(B1) | 2005-02-01 | Ma et al. | Applicant |
| US6871295(B2) | 2005-03-01 | Ulrich et al. | Applicant |
| US6895482(B1) | 2005-05-01 | Blackmon et al. | Applicant |
| US6895534(B2) | 2005-05-01 | Wong et al. | Applicant |
| US6907011(B1) | 2005-06-01 | Miller et al. | Applicant |
| US6907520(B2) | 2005-06-01 | Parady | Applicant |
| US6917942(B1) | 2005-07-01 | Burns et al. | Applicant |
| US6920494(B2) | 2005-07-01 | Heitman et al. | Applicant |
| US6922696(B1) | 2005-07-01 | Lincoln et al. | Applicant |
| US6922708(B1) | 2005-07-01 | Sedlar | Applicant |
| US6934878(B2) | 2005-08-01 | Massa et al. | Applicant |
| US6940966(B2) | 2005-09-01 | Lee | Applicant |
| US6954435(B2) | 2005-10-01 | Billhartz et al. | Applicant |
| US6990604(B2) | 2006-01-01 | Binger | Examiner |
| US6990611(B2) | 2006-01-01 | Busser | Applicant |
| US7007044(B1) | 2006-02-01 | Rafert et al. | Applicant |
| US7007097(B1) | 2006-02-01 | Huffman et al. | Applicant |
| US7017003(B2) | 2006-03-01 | Murotani et al. | Applicant |
| US7043485(B2) | 2006-05-01 | Manley et al. | Applicant |
| US7043567(B2) | 2006-05-01 | Trantham | Applicant |
| US7069320(B1) | 2006-06-01 | Chang et al. | Applicant |
| US7103597(B2) | 2006-09-01 | McGoveran | Applicant |
| US7111305(B2) | 2006-09-01 | Solter et al. | Applicant |
| US7113938(B2) | 2006-09-01 | Highleyman et al. | Applicant |
| US7124264(B2) | 2006-10-01 | Yamashita | Applicant |
| US7146524(B2) | 2006-12-01 | Patel et al. | Applicant |
| US7152182(B2) | 2006-12-01 | Ji et al. | Applicant |
| US7177295(B1) | 2007-02-01 | Sholander et al. | Applicant |
| US7181746(B2) | 2007-02-01 | Perycz et al. | Applicant |
| US7184421(B1) | 2007-02-01 | Liu et al. | Applicant |
| US7194487(B1) | 2007-03-01 | Kekre et al. | Applicant |
| US7206805(B1) | 2007-04-01 | McLaughlin, Jr. | Applicant |
| US7225204(B2) | 2007-05-01 | Manley et al. | Applicant |
| US7228299(B1) | 2007-06-01 | Harmer et al. | Applicant |
| US7240235(B2) | 2007-07-01 | Lewalski-Brechter | Applicant |
| US7249118(B2) | 2007-07-01 | Sandler et al. | Applicant |
| US7257257(B2) | 2007-08-01 | Anderson et al. | Applicant |
| US7290056(B1) | 2007-10-01 | McLaughlin, Jr. | Applicant |
| US7313614(B2) | 2007-12-01 | Considine et al. | Applicant |
| US7318134(B1) | 2008-01-01 | Oliveira et al. | Applicant |
| US7346720(B2) | 2008-03-01 | Fachan | Applicant |
| US7370064(B2) | 2008-05-01 | Yousefi'zadeh | Applicant |
| US7373426(B2) | 2008-05-01 | Jinmei et al. | Applicant |
| US7386675(B2) | 2008-06-01 | Fachan | Applicant |
| US7386697(B1) | 2008-06-01 | Case et al. | Applicant |
| US7440966(B2) | 2008-10-01 | Adkins et al. | Applicant |
| US7451341(B2) | 2008-11-01 | Okaki et al. | Applicant |
| US7509448(B2) | 2009-03-01 | Fachan et al. | Applicant |
| US7509524(B2) | 2009-03-01 | Patel et al. | Applicant |
| US7533298(B2) | 2009-05-01 | Smith et al. | Applicant |
| US7546354(B1) | 2009-06-01 | Fan et al. | Applicant |
| US7546412(B2) | 2009-06-01 | Ahmad et al. | Applicant |
| US7551572(B2) | 2009-06-01 | Passey et al. | Applicant |
| US7558910(B2) | 2009-07-01 | Alverson et al. | Applicant |
| US7571348(B2) | 2009-08-01 | Deguchi et al. | Applicant |
| US7577667(B2) | 2009-08-01 | Hinshaw et al. | Applicant |
| US7590652(B2) | 2009-09-01 | Passey et al. | Applicant |
| US7593938(B2) | 2009-09-01 | Lemar et al. | Applicant |
| US7596713(B2) | 2009-09-01 | Mani-Meitav et al. | Applicant |
| US7631066(B1) | 2009-12-01 | Schatz et al. | Applicant |
| US7676691(B2) | 2010-03-01 | Fachan et al. | Applicant |
| US7680836(B2) | 2010-03-01 | Anderson et al. | Applicant |
| US7680842(B2) | 2010-03-01 | Anderson et al. | Applicant |
| US7685126(B2) | 2010-03-01 | Patel et al. | Applicant |
| US7716262(B2) | 2010-05-01 | Pallapotu | Applicant |
| US7739288(B2) | 2010-06-01 | Lemar et al. | Applicant |
| US7743033(B2) | 2010-06-01 | Patel et al. | Applicant |
| US7752402(B2) | 2010-07-01 | Fachan et al. | Applicant |
| US7756898(B2) | 2010-07-01 | Passey et al. | Applicant |
| US7779048(B2) | 2010-08-01 | Fachan et al. | Applicant |
| US7783666(B1) | 2010-08-01 | Zhuge et al. | Applicant |
| US7788303(B2) | 2010-08-01 | Mikesell et al. | Applicant |
| US7797283(B2) | 2010-09-01 | Fachan et al. | Applicant |
| US7822932(B2) | 2010-10-01 | Fachan et al. | Applicant |
| US2001/0042224(A1) | 2001-11-01 | Stanfill et al. | Applicant |
| US2001/0047451(A1) | 2001-11-01 | Noble et al. | Applicant |
| US2001/0056492(A1) | 2001-12-01 | Bressoud et al. | Applicant |
| US2002/0010696(A1) | 2002-01-01 | Izumi | Applicant |
| US2002/0029200(A1) | 2002-03-01 | Dulin et al. | Applicant |
| US2002/0035668(A1) | 2002-03-01 | Nakano et al. | Applicant |
| US2002/0038436(A1) | 2002-03-01 | Suzuki | Applicant |
| US2002/0055940(A1) | 2002-05-01 | Elkan | Applicant |
| US2002/0072974(A1) | 2002-06-01 | Pugliese et al. | Applicant |
| US2002/0075870(A1) | 2002-06-01 | de Azevedo et al. | Applicant |
| US2002/0078161(A1) | 2002-06-01 | Cheng | Applicant |
| US2002/0078180(A1) | 2002-06-01 | Miyazawa | Applicant |
| US2002/0083078(A1) | 2002-06-01 | Pardon et al. | Applicant |
| US2002/0083118(A1) | 2002-06-01 | Sim | Applicant |
| US2002/0087366(A1) | 2002-07-01 | Collier et al. | Applicant |
| US2002/0095438(A1) | 2002-07-01 | Rising et al. | Applicant |
| US2002/0107877(A1) | 2002-08-01 | Whiting et al. | Applicant |
| US2002/0124137(A1) | 2002-09-01 | Ulrich et al. | Applicant |
| US2002/0138559(A1) | 2002-09-01 | Ulrich et al. | Applicant |
| US2002/0156840(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0156891(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0156973(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0156974(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0156975(A1) | 2002-10-01 | Staub et al. | Applicant |
| US2002/0158900(A1) | 2002-10-01 | Hsieh et al. | Applicant |
| US2002/0161846(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0161850(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0161973(A1) | 2002-10-01 | Ulrich et al. | Applicant |
| US2002/0163889(A1) | 2002-11-01 | Yemini et al. | Applicant |
| US2002/0165942(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0166026(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0166079(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0169827(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0170036(A1) | 2002-11-01 | Cobb et al. | Applicant |
| US2002/0174295(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0174296(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0178162(A1) | 2002-11-01 | Ulrich et al. | Applicant |
| US2002/0191311(A1) | 2002-12-01 | Ulrich et al. | Applicant |
| US2002/0194523(A1) | 2002-12-01 | Ulrich et al. | Applicant |
| US2002/0194526(A1) | 2002-12-01 | Ulrich et al. | Applicant |
| US2002/0198864(A1) | 2002-12-01 | Ostermann et al. | Applicant |
| US2003/0005159(A1) | 2003-01-01 | Kumhyr | Applicant |
| US2003/0009511(A1) | 2003-01-01 | Giotta et al. | Applicant |
| US2003/0014391(A1) | 2003-01-01 | Evans et al. | Applicant |
| US2003/0125852(A1) | 2003-01-01 | Meschewski et al. | Applicant |
| US2003/0033308(A1) | 2003-02-01 | Patel et al. | Applicant |
| US2003/0061491(A1) | 2003-03-01 | Jaskiewicz et al. | Applicant |
| US2003/0109253(A1) | 2003-06-01 | Fenton et al. | Applicant |
| US2003/0120863(A1) | 2003-06-01 | Lee et al. | Applicant |
| US2003/0135514(A1) | 2003-07-01 | Patel et al. | Applicant |
| US2003/0149750(A1) | 2003-08-01 | Franzenburg | Applicant |
| US2003/0158873(A1) | 2003-08-01 | Sawdon et al. | Applicant |
| US2003/0161302(A1) | 2003-08-01 | Zimmermann et al. | Applicant |
| US2003/0163726(A1) | 2003-08-01 | Kidd | Applicant |
| US2003/0172149(A1) | 2003-09-01 | Edsall et al. | Applicant |
| US2003/0177308(A1) | 2003-09-01 | Lewalski-Brechter | Applicant |
| US2003/0182325(A1) | 2003-09-01 | Manely et al. | Applicant |
| US2003/0233385(A1) | 2003-12-01 | Srinivasa et al. | Applicant |
| US2004/0003053(A1) | 2004-01-01 | Williams | Applicant |
| US2004/0024731(A1) | 2004-02-01 | Cabrera et al. | Applicant |
| US2004/0024963(A1) | 2004-02-01 | Talagala et al. | Applicant |
| US2004/0078812(A1) | 2004-04-01 | Calvert | Applicant |
| US2004/0117802(A1) | 2004-06-01 | Green | Applicant |
| US2004/0133670(A1) | 2004-07-01 | Kaminsky et al. | Applicant |
| US2004/0143647(A1) | 2004-07-01 | Cherkasova | Applicant |
| US2004/0153479(A1) | 2004-08-01 | Mikesell et al. | Applicant |
| US2004/0158549(A1) | 2004-08-01 | Matena et al. | Applicant |
| US2004/0189682(A1) | 2004-09-01 | Troyansky et al. | Applicant |
| US2004/0199734(A1) | 2004-10-01 | Rajamani et al. | Applicant |
| US2004/0199812(A1) | 2004-10-01 | Earl et al. | Applicant |
| US2004/0205141(A1) | 2004-10-01 | Goland | Applicant |
| US2004/0230748(A1) | 2004-11-01 | Ohba | Applicant |
| US2004/0240444(A1) | 2004-12-01 | Matthews et al. | Applicant |
| US2004/0260673(A1) | 2004-12-01 | Hitz et al. | Applicant |
| US2004/0267747(A1) | 2004-12-01 | Choi et al. | Applicant |
| US2005/0010592(A1) | 2005-01-01 | Guthrie | Applicant |
| US2005/0033778(A1) | 2005-02-01 | Price | Applicant |
| US2005/0044197(A1) | 2005-02-01 | Lai | Applicant |
| US2005/0066095(A1) | 2005-03-01 | Mullick et al. | Applicant |
| US2005/0114402(A1) | 2005-05-01 | Guthrie | Applicant |
| US2005/0114609(A1) | 2005-05-01 | Shorb | Applicant |
| US2005/0125456(A1) | 2005-06-01 | Hara et al. | Applicant |
| US2005/0131860(A1) | 2005-06-01 | Livshits | Applicant |
| US2005/0131990(A1) | 2005-06-01 | Jewell | Applicant |
| US2005/0138195(A1) | 2005-06-01 | Bono | Applicant |
| US2005/0138252(A1) | 2005-06-01 | Gwilt | Applicant |
| US2005/0171960(A1) | 2005-08-01 | Lomet | Applicant |
| US2005/0171962(A1) | 2005-08-01 | Martin et al. | Applicant |
| US2005/0187889(A1) | 2005-08-01 | Yasoshima | Applicant |
| US2005/0188052(A1) | 2005-08-01 | Ewanchuk et al. | Applicant |
| US2005/0192993(A1) | 2005-09-01 | Messinger | Applicant |
| US2005/0289169(A1) | 2005-12-01 | Adya et al. | Applicant |
| US2005/0289188(A1) | 2005-12-01 | Nettleton et al. | Applicant |
| US2006/0004760(A1) | 2006-01-01 | Clift et al. | Applicant |
| US2006/0041894(A1) | 2006-02-01 | Cheng et al. | Applicant |
| US2006/0047925(A1) | 2006-03-01 | Perry | Applicant |
| US2006/0059467(A1) | 2006-03-01 | Wong | Applicant |
| US2006/0074922(A1) | 2006-04-01 | Nishimura | Applicant |
| US2006/0083177(A1) | 2006-04-01 | Iyer et al. | Applicant |
| US2006/0095438(A1) | 2006-05-01 | Fachan et al. | Applicant |
| US2006/0101062(A1) | 2006-05-01 | Godman et al. | Applicant |
| US2006/0129584(A1) | 2006-06-01 | Hoang et al. | Applicant |
| US2006/0129631(A1) | 2006-06-01 | Na et al. | Applicant |
| US2006/0129983(A1) | 2006-06-01 | Feng | Applicant |
| US2006/0155831(A1) | 2006-07-01 | Chandrasekaran | Applicant |
| US2006/0206536(A1) | 2006-09-01 | Sawdon et al. | Applicant |
| US2006/0230411(A1) | 2006-10-01 | Richter et al. | Applicant |
| US2006/0277432(A1) | 2006-12-01 | Patel | Applicant |
| US2006/0288161(A1) | 2006-12-01 | Cavallo | Applicant |
| US2007/0038887(A1) | 2007-02-01 | Witte et al. | Applicant |
| US2007/0091790(A1) | 2007-04-01 | Passey et al. | Applicant |
| US2007/0094269(A1) | 2007-04-01 | Mikesell et al. | Applicant |
| US2007/0094277(A1) | 2007-04-01 | Fachan et al. | Applicant |
| US2007/0094310(A1) | 2007-04-01 | Passey et al. | Applicant |
| US2007/0094431(A1) | 2007-04-01 | Fachan | Applicant |
| US2007/0094452(A1) | 2007-04-01 | Fachan | Applicant |
| US2007/0168351(A1) | 2007-07-01 | Fachan | Applicant |
| US2007/0171919(A1) | 2007-07-01 | Godman et al. | Applicant |
| US2007/0195810(A1) | 2007-08-01 | Fachan | Applicant |
| US2007/0233684(A1) | 2007-10-01 | Verma et al. | Applicant |
| US2007/0233710(A1) | 2007-10-01 | Passey et al. | Applicant |
| US2007/0255765(A1) | 2007-11-01 | Robinson | Applicant |
| US2008/0005145(A1) | 2008-01-01 | Worrall | Applicant |
| US2008/0010507(A1) | 2008-01-01 | Vingralek | Applicant |
| US2008/0021907(A1) | 2008-01-01 | Patel et al. | Applicant |
| US2008/0031238(A1) | 2008-02-01 | Harmelin et al. | Applicant |
| US2008/0034004(A1) | 2008-02-01 | Cisler et al. | Applicant |
| US2008/0044016(A1) | 2008-02-01 | Henzinger | Applicant |
| US2008/0046432(A1) | 2008-02-01 | Anderson et al. | Applicant |
| US2008/0046443(A1) | 2008-02-01 | Fachan et al. | Applicant |
| US2008/0046444(A1) | 2008-02-01 | Fachan et al. | Applicant |
| US2008/0046445(A1) | 2008-02-01 | Passey et al. | Applicant |
| US2008/0046475(A1) | 2008-02-01 | Anderson et al. | Applicant |
| US2008/0046476(A1) | 2008-02-01 | Anderson et al. | Applicant |
| US2008/0046667(A1) | 2008-02-01 | Fachan et al. | Applicant |
| US2008/0059541(A1) | 2008-03-01 | Fachan et al. | Applicant |
| US2008/0059734(A1) | 2008-03-01 | Mizuno | Applicant |
| US2008/0126365(A1) | 2008-05-01 | Fachan et al. | Applicant |
| US2008/0151724(A1) | 2008-06-01 | Anderson et al. | Applicant |
| US2008/0154978(A1) | 2008-06-01 | Lemar et al. | Applicant |
| US2008/0155191(A1) | 2008-06-01 | Anderson et al. | Applicant |
| US2008/0168304(A1) | 2008-07-01 | Flynn et al. | Applicant |
| US2008/0168458(A1) | 2008-07-01 | Fachan et al. | Applicant |
| US2008/0243773(A1) | 2008-10-01 | Patel et al. | Applicant |
| US2008/0256103(A1) | 2008-10-01 | Fachan et al. | Applicant |
| US2008/0256537(A1) | 2008-10-01 | Fachan et al. | Applicant |
| US2008/0256545(A1) | 2008-10-01 | Fachan et al. | Applicant |
| US2008/0294611(A1) | 2008-11-01 | Anglin et al. | Applicant |
| US2009/0055399(A1) | 2009-02-01 | Lu et al. | Applicant |
| US2009/0055604(A1) | 2009-02-01 | Lemar et al. | Applicant |
| US2009/0055607(A1) | 2009-02-01 | Schack et al. | Applicant |
| US2009/0210880(A1) | 2009-08-01 | Fachan et al. | Applicant |
| US2009/0248756(A1) | 2009-10-01 | Akidau et al. | Applicant |
| US2009/0248765(A1) | 2009-10-01 | Akidau et al. | Applicant |
| US2009/0248975(A1) | 2009-10-01 | Daud et al. | Applicant |
| US2009/0249013(A1) | 2009-10-01 | Daud et al. | Applicant |
| US2009/0252066(A1) | 2009-10-01 | Passey et al. | Applicant |
| US2009/0327218(A1) | 2009-12-01 | Passey et al. | Applicant |
| US2010/0161556(A1) | 2010-06-01 | Anderson et al. | Applicant |
| US2010/0161557(A1) | 2010-06-01 | Anderson et al. | Applicant |
| US2010/0185592(A1) | 2010-07-01 | Kryger | Applicant |
| US2010/0223235(A1) | 2010-09-01 | Fachan | Applicant |
| US2010/0235413(A1) | 2010-09-01 | Patel | Applicant |
| US2010/0241632(A1) | 2010-09-01 | Lemar et al. | Applicant |
| US2010/0306786(A1) | 2010-12-01 | Passey | Applicant |
| EP774723 | 1997-05-01 | Applicant | |
| JP2006-506741 | 2004-06-01 | Applicant | |
| JP4464279 | 2010-05-01 | Applicant | |
| JP4504677 | 2010-07-01 | Applicant | |
| WO94/29796 | 1994-12-01 | Applicant | |
| WO/57315 | 2000-09-01 | Applicant | |
| WO1/14991 | 2001-03-01 | Applicant | |
| WO1/33829 | 2001-05-01 | Applicant | |
| WO2/061737 | 2002-08-01 | Applicant | |
| WO3/012699 | 2003-02-01 | Applicant | |
| WO2004/046971 | 2004-06-01 | Applicant | |
| WO2008/021527 | 2008-02-01 | Applicant | |
| WO2008/021528 | 2008-02-01 | Applicant | |
| WO2008/127947 | 2008-10-01 | Applicant |
Non-Patent Literature (86)
- Nov. 15, 2002 International Search Report PCT/US02/24728.Applicant
- Apr. 20, 2004 International Search Report PCT/US03/36699.Applicant
- Aug. 6, 2004 International Search Report PCT/US03/33704.Applicant
- Feb. 22, 2008 International Search Report PCT/US07/018326.Applicant
- Steven M. Bauer, Letter to Steve Goldman, Jul. 31, 2006 (including the first page of the patents).Applicant
- Arthur S. Rose, Letter to Steven M. Bauer, Aug. 7, 2006.Applicant
- Steven M. Bauer, Letter to Arthur S. Rose, Sep. 25, 2006.Applicant
- Steven M. Bauer, Letter to Arthur S. Rose, Oct. 31, 2006.Applicant
- Arthur S. Rose, Letter to Steven M. Bauer, Nov. 9, 2006.Applicant
- Steven M. Bauer, Letter to Arthur S. Rose, Feb. 6, 2007.Applicant
- Arthur S. Rose, Letter to Steven M. Bauer, Feb. 23, 2007.Applicant
- Steven M. Bauer, Letter to Arthur S. Rose, Jun. 7, 2007 (including claim chart).Applicant
- Arthur S. Rose, Letter to Steven M. Bauer, Jun. 22, 2007.Applicant
- Todd A. Gerety, Letter to Arthur S. Rose, Jun. 26, 2007 (including exhibits listed separately).Applicant
- Isilon Systems, “Isilon IQ Plateform Overview”, 1-4.Applicant
- Isilon Systems, “Uncompromising Reliability through Clustered Storage”, Sep. 2006, 1-10.Applicant
- Byteandswitch, “Discovery Chooses Isilon,” Apr. 23, 2007, 1.Applicant
- Taneja Group Technology Analysts, “The Power of InfiniBand and Clustered Storage”, Dec. 2005, 1-8.Applicant
- Arthur S. Rose, Letter to Steven M. Bauer, Aug. 31, 2007.Applicant
- Ramez Elmasri, Fundamentals of Database Systems 3rd ed, Sep. 30, 1999, Addison-Wesley, pp. 155, 169, 171, 172, 173, 178, 181, 182, 381, 771.Applicant
- May 8, 2008 Int'l Search report PCT/US07/018324, 13 pages.Applicant
- Kumar Akhil, “An analysis of borrowing policies for escrow transactions in a replicated data environment”, Institute of Electrical and Electronics Engineers; Proceedings of the International Conference on Data Engineering, Los Angeles, Feb. 5-9, 1990; Los Alamitos, IEEE, Comp. Soc. Press, US. vol. Conf. 6, Feb. 5, 1990, pp. 446-454, XP010018185 ISBN: 978-0-8186-2025-6 p. 446, left-hand column, line 1—p. 447, last line.Applicant
- MCSA/MSCE/MCDBA Self Paced Training Kit: MS SQL Server 2000 System Administration, May 14, 2003, Microsoft Press, Second Edition, 12 pages.Applicant
- Supp EPO Search Report, App. No. EP 03 78 3599; dated Apr. 29, 2008, 2 pages.Applicant
- Levy E., Ed.—Institute of Electrical and Electronics Engineers: “Incremental restart (database management)” Proc. Int. Conf. Data Eng., Kobe, JP, Apr. 8-12, 1991; IEEE Comp. Soc. Press, U.S., vol. Conf. 7, Apr. 8, 1991, pp. 640-648.Applicant
- Haerder T et al: “Principles of Transaction-Oriented Database Recovery” ACM Computing Surveys, ACM, New York, NY, US, vol. 15, No. 4, Dec. 1, 1983, pp. 287-317.Applicant
- Gray J et al: “Transaction processing: concepts and techniques (excerpt), Passage” Transaction Processing: Concepts and Techniques, Jan. 1, 1993, pp. 373-445.Applicant
- Garcia-Molina H et al: “Database System Implementation, passage” Database System Implementation, Jan. 1, 2000, pp. I-V, 423-509.Applicant
- Wedde H. F., et al.: “A universal framework for managing metadata in the distributed Dragon Slayer System”, Proceedings of the Euromicro Conference. Euromicro. Informatics: Inventing the Future, Proceedings of Euromicro Workshop On Multimedia and Telecommunications, vol. 2, Sep. 5, 2000, pp. 96-101.Applicant
- Tanenbaum, Andrew S., MINIX Operating System, Japan, Apr. 21, 1989, 1st Edition, pp. 328, 505; Also attached is what Applicant believes is the English language version: Tanenbaum, Andrew S., Operating Systems: Design and Implementation, Prentice-Hall, 1987, pp. 279, 347, 348.Applicant
- Yamashita, Hirofumi, et al., “Development of RAID Filesystem VAFS/HR,” The Special Interest Group Notes of IPSJ, Japan, Information Processing Society of Japan, Sep. 16, 1994, vol. 94, No. 80, p. 9-16.Applicant
- Dec. 11, 2007 Non-Final Rejection in U.S. Appl. No. 11/255,818, filed Oct. 21, 2005.Applicant
- May 12, 2008 Response to Dec. 11, 2007 Non-Final Rejection in U.S. Appl. No. 11/255,818, filed Oct. 21, 2005.Applicant
- Oct. 2, 2008 Final Rejection in U.S. Appl. No. 11/255,818, filed Oct. 21, 2005.Applicant
- Apr. 1, 2009 Response to Oct. 2, 2008 Final Rejection in U.S. Appl. No. 11/255,818, filed Oct. 21, 2005.Applicant
- Jun. 4, 2009 Non-Final Rejection in U.S. Appl. No. 11/255,818, filed Oct. 21, 2005.Applicant
- Sep. 4, 2009 Response to Jun. 4, 2009 Non-Final Rejection in U.S. Appl. No. 11/255,818, filed Oct. 21, 2005.Applicant
- May 18, 2009 Int'l Search report PCT/US08/059798, 18 pages.Applicant
- Lougher P. et al., “Scalable storage servers for digital audio and video,” International Conference on Storage and Recording Systems, 1994, Keele, UK, Jan. 1, 1994, pp. 140-143.Applicant
- Reddy, P. Krishna et al., Reducing the blocking in two phase commit with backup sites Apr. 15, 2003, Elsevier, pp. 39-47.Applicant
- IOS Commands, Feb. 6, 2005, Pantz.org, [online], <web.archive.org/web/20050206184604/http://pantz.org/os/ios/oscommands.shtml>, pp. 1-12 as printed.Applicant
- IP Forwarding with Cisco Routers Lab Exercises, Jun. 15, 1999 [online], <ws.edu.isoc.org/data1999/1481713642400af6a2de65a/ip—fwd—cisco—config.ppt>, pp. 1-11 as printed.Applicant
- Hisyuki Aoki, Parallel Filesystem MFS, IPSJ SIG Technical Reports, Japan, Information Processing Society of Japan, Aug. 26, 1996, vol. 96, No. 79, pp. 31-36 (1′. English language abstract).Applicant
- Yoshitake Shinkai, Cluster File System: HAMFS, FUJITSU, Japan, Fujitsu Limited, Jul. 9, 1999, vol. 50, No. 4, pp. 210-214 (2′. English language abstract).Applicant
- Hirofumi Yamashita, Development of RAID Filesystem FAFS/HR, IPSJ SIG Technical Reports, Japan, Information Processing Society of Japan, Sep. 16, 1994, vol. 94, No. 80, pp. 9-16 (3′. English language abstract).Applicant
- Philip A. Bernstein, Vassos Hadzilacos, and Nathan Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987.Applicant
- Birk, Y., Deterministic load-balancing schemes for disk-based video-on-demand storage servers, Mass Storage Systems 1995; Storage—At the Forefront of Information Infrastructures', Proceedings of the Fourteenth IEEE Symposium on Monterey, CA, Sep. 11-14, 1995, pp. 17-25.Applicant
- Kenneth P. Birman, Building Secure and Reliable Network Applications, Manning, 1996, pp. 1-327.Applicant
- Kenneth P. Birman, Building Secure and Reliable Network Applications, Manning, 1996, pp. 328-620.Applicant
- Coulouris et al., Distributed Systems Concepts and Design, Addison-Wesley, Second Edition, 1994, pp. 353-371 and 377-405.Applicant
- Jim Gray and Andreas Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1993, pp. 1-328.Applicant
- Jim Gray and Andreas Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1993, pp. 329-664.Applicant
- Jim Gray and Andreas Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufmann, 1993, pp. 665-1105.Applicant
- Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann, 1996, pp. 1-409.Applicant
- Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann, 1996, pp. 410-871.Applicant
- Sape Mullender, editor, Distributed Systems (2nd Ed.), ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 1993, pp. 1-327.Applicant
- Sape Mullender, editor, Distributed Systems (2nd Ed.), ACM Press/Addison-Wesley Publishing Co., New York, NY, USA, 1993, pp. 328-604.Applicant
- Gibson, Garth A. et al., The Scotch Parallel Storage System, IEEE, 1995, pp. 403-410.Applicant
- Gerhard Weikum, et al., Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery, Morgan Kaufmann, 2002, pp. 1-450.Applicant
- Gerhard Weikum, et al., Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery, Morgan Kaufmann, 2002, pp. 451-863.Applicant
- Sanjay Ghemawat et al., The Google File System, Symposium on Operating Systems Principles, Oct. 19-22, 2003, 15 pages, Bolton Landing, NY.Applicant
- Pei Cao et al., The TickerTAIP parallel RAID architecture, 1993, 12 pages, Princeton, NJ.Applicant
- Pei Cao et al., The TickerTAIP parallel RAID architecture, ACM Transactions on Computer Systems, vol. 12, No. 3, Aug. 1994, 34 pages, Palto Alto, California.Applicant
- Bob Duzett, et al., An Overview of the nCube 3 Supercomputer, IEEE, Jul. 1992, pp. 458-464.Applicant
- John Henry Hartman, The Zebra Striped Network File System, 1994, pp. 1-148, University of California at Berkeley.Applicant
- Darrell D.E. Long et al., Swift/RAID: A Distributed Raid System, Computing Systems, vol. 7, No. 3 Summer 1994, pp. 333-359.Applicant
- Michael Stonebraker et al., Distributed Raid: A new Multiple copy Algorithm, IEEE 1990, pp. 430-437, Berkeley, California.Applicant
- United States Court of Appeals, Federal Circuit, Seachange International, Inc. Vs. nCUBE, Corp., Oct. 26, 2004, 28 pages.Applicant
- United States Court of Appeals, Federal Circuit, Seachange International, Inc. Vs. C-Cor, Inc., Jun. 29, 2005, 22 pages.Applicant
- United States District Court, Delaware, Seachange International, Inc. Vs. nCUBE, Corp., Apr. 7, 2004, 13 pages.Applicant
- United States District Court, Delaware, Seachange International, Inc. Vs. nCUBE, Corp., Aug. 29, 2000, 12 pages.Applicant
- European Search Report dated May 21, 2007 issued to EP application No. 02756944.1-2201.Applicant
- Stallings, William, “Operating Systems,” Prentice Hall, Fourth Edition, 2001, pp. 197-253 and 265-293.Applicant
- Oct. 8, 2008 European Supplemental Search Report EP 02 75 6944, 6 pages.Applicant
- Jan. 23, 2009 Examination Report EP 02 75 6944, 5 pages.Applicant
- Oct. 22, 2009 Int'l Preliminary Report on Patentability PCT/US08/059798, 10 pages.Applicant
- Keidar, et al.: Increasing the Resilience of Distributed and Replicated Database Systems (1998) pp. 1-25.Applicant
- Dec. 21, 2009 Final OA in U.S. Appl. No. 11/255,818, filed Oct. 21, 2005.Applicant
- Jun. 1, 2010 Notice of Allowance in U.S. Appl. No. 11/255,818, filed Oct. 21, 2005.Applicant
- Dec. 21, 2009 Final OA in U.S. Appl. No. 11/255,818 filed on Oct. 21, 2005.Applicant
- Jun. 1, 2010 Notice of Allowance in U.S. Appl. No. 11/255,818 filed on Oct. 21, 2005.Applicant
- Aug. 25, 2010 Issue Notification in U.S. Appl. No. 11/255,818 filed on Oct. 21, 2005.Applicant
- Duchamp, Dan: “Analysis of Transaction Management Performance”, ACM Symposium on Operating Systems Principles, Dec. 1989, pp. 177-190.Applicant
- Silaghi, Raul et al.: “Porting OMTTs to CORBA”, Lecture Notes in Computer Science, vol. 2888/2003, Nov. 2003, pp. 1521-1542.Applicant
- Dorai et al.:, “Transport Threads: Resource Sharing in SMT Processor for High Single-Thread Performance”, proceedings of the 2002 International Conference on Parallel Architectures and Complication Techniques, Sep. 2002, 12 pages.Applicant
- Peterson, Zachary Nathaniel Joseph, “Data Placement For Copy-On-Write Using Virtual Contiguity,” Master of Science in Computer Science Thesis, University of California, Santa Cruz, Sep. 2002, 67 pages.Applicant