US20120131023A1 - Anti-Item for Deletion of Content In A Distributed Datastore - Google Patents
Anti-Item for Deletion of Content In A Distributed Datastore Download PDFInfo
- Publication number
- US20120131023A1 US20120131023A1 US13/361,831 US201213361831A US2012131023A1 US 20120131023 A1 US20120131023 A1 US 20120131023A1 US 201213361831 A US201213361831 A US 201213361831A US 2012131023 A1 US2012131023 A1 US 2012131023A1
- Authority
- US
- United States
- Prior art keywords
- item
- key
- tuple
- datastore
- deletion
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2379—Updates performed during online database operations; commit processing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/964—Database arrangement
- Y10S707/966—Distributed
Definitions
- the invention relates to the storage of information. More particularly, the invention relates to an anti-item for deletion of content in a distributed datastore.
- a single data item may be stored in one or more locations, i.e. on more than one server.
- the location(s) at which a data item is stored is determined by an insertion procedure in which the inserted item is propagated through a network of servers to the one or more servers that eventually store the data.
- Such an insertion procedure presents challenges if the need for deletion of data items arises because it may be inconvenient or computationally expensive to determine directly the locations at which a particular data item is stored.
- the invention provides an efficient apparatus and method for deleting items within a distributed datastore.
- the invention provides an apparatus and method of deletion that uses an already well defined procedure for insertion of data.
- FIG. 1 is a block schematic diagram showing an exemplary distributed datastore according to the invention
- FIG. 2 is a block schematic diagram showing superior and inferior nodes, and a sense of upstream and downstream according to the invention
- FIG. 3 is a block schematic diagram showing hosting ranges of the nodes according to the invention.
- FIG. 4 is a block schematic diagram showing coverages of the nodes according to the invention.
- FIG. 5 is a block schematic diagram showing insertion of a tuple according to the invention.
- FIG. 6 is a block schematic diagram showing insertion of an anti-tuple, i.e. deletion of a tuple, according to the invention.
- the invention facilitates the deletion of data items from a distributed datastore via the addition of anti-items using a standard data insertion procedure. Successful operation of the invention is possible in a datastore where:
- an anti-item is the same as that of a conventional data item, but for a single tag, flag, or bit which indicates that it is an anti-item.
- this additional tag does not affect the location at which a data item or anti-item is ultimately stored within the datastore.
- These properties ensure that, upon insertion, the anti-item reaches the same location or locations within the datastore as the original data item. After the anti-item has reached these locations, the data item is considered deleted. Deletion may entail the actual removal of both the data item and the anti-item from the datastore. Such annihilations may be executed upon arrival of the anti-item at the storage location or through a periodic, off-line garbage collection process. Alternatively, the anti-item may be forever stored alongside the data item. In this case, the presence of the anti-item alongside the data item excludes the data item from subsequent data retrieval operations.
- the invention is more clearly understood through consideration of an exemplary distributed data-store that satisfies the above characteristics.
- the exemplary datastore consists of multiple nodes connected in a directed, acyclic graph, as shown in FIG. 1 , in which four interconnected nodes (Na, Nb, Nc, and Nd) are illustrated. Storage of data occurs at nodes, which are preferably servers with caching or hard disk data storage capabilities, or a combination thereof.
- a particular installation of the datastore is characterized by a key list containing N keys.
- Each key within the key list is defined by an ordered list of values vi and an integer k.
- the integer represents the position of the key within the key list.
- a key may thus be expressed as
- M denotes the number of values within the key.
- the ordered list of values is simply a range of integers.
- a key may be the defined as the integers between 1 and 10, inclusive. That is,
- Data items within the datastore take the form of tuples of length N, expressed as
- kj are key values, selected from the jth key within the key list.
- a key range is a contiguous subset of the indices into the ordered list of values that define a key.
- a key range is expressed as a pair of integers representing the ends of the range, inclusive. That is,
- a hosting range is a set of N key ranges that defines a subset of all tuples that can be expressed using the key list. For example, for the key list of Equation (4), the hosting range
- a hosting range may be expressed using a set of tuples defining the corners of the covered region.
- the hosting range of Equation (7) may be expressed as
- nodes may be characterized by a rank. Nodes having a lower rank are termed inferior, and nodes having a higher rank are termed superior. Nodes may only seek data from superior nodes, as indicated by the direction of the arrows. That is, requests for data may be passed to superior nodes but may not be passed to inferior nodes.
- the coverage of a node is the union of the tuples within its hosting range and the tuples within the hosting ranges of the superior nodes to which it is connected.
- a node advertises its coverage to the inferior nodes to which it is connected.
- an administrator configures the network of nodes, explicitly indicating the connectivity between nodes, and the hosting ranges of each, and this calculation must be performed once upon system configuration.
- the connectivity of nodes and the hosting ranges of the nodes may be adjusted dynamically in response to measured system loads. In such systems, the advertising of coverage occurs on an ongoing basis.
- a node has full coverage when its coverage contains all tuples that may be specified with the key list. For any tuple, a node with full coverage either hosts the tuple itself, or is connected to a superior node that advertises coverage for the tuple. By definition, a node is of rank zero if and only if it has full coverage.
- FIG. 3 shows a set of possible hosting ranges for the distributed datastore of FIG. 1 with the key list of Equation (4). The resulting coverages are shown in FIG. 4 .
- Insertion of data into the datastore is performed by a client that connects to the datastore. Instructions to insert data are only passed from inferior nodes to superior nodes. Thus, to ensure that any tuple within the key list can be inserted properly, it is required that the client connect only to nodes of rank zero.
- FIG. 5 shows an example of the data insertion procedure in which the client inserts the tuple (5, 6) at node Na. Because node Na is of rank zero, the inserted tuple is within its coverage. However, the inserted tuple is not within the hosting range of node Na, so node Na does not store the tuple locally. Node Na then considers the coverage of the superior nodes to which it is connected and passes the insertion request to those superior nodes that provide coverage for the inserted tuple. In this case, both Nb and Nc and provide coverage for the tuple (5, 6). Node Nb receives the insertion request.
- the inserted tuple is within the hosting range of node Nb, so node Nb stores the tuple locally. After storing the tuple locally, node Nb considers the coverage of the superior nodes to which it is connected. The inserted tuple is within the coverage of node Nc but not within the coverage of node Nd. Node Nb therefore passes the insertion request to node Nc but not to node Nd.
- node Nc receives two insertion requests for the tuple (5, 6). Upon receipt of the first insertion request, node Nc determines that the tuple is within its hosting range. The tuple is therefore stored locally. Upon receipt of the second insertion request, node Nc again determines that the tuple is within its hosting range. However, it then notes that the tuple is already within its local storage and therefore ignores the second insertion request. Because node Nc is not connected to any superior nodes, the insertion procedure then terminates.
- the deletion procedure of the current invention is preferably implemented within the exemplary datastore through the addition of a deletion key to the key list.
- the key list is defined as
- the deletion key Kd is added solely to differentiate tuples from anti-tuples, i.e. items from anti-items. Tuples are of the form (a, b, 0), and all anti-tuples are of the form (c, d, 1).
- the deletion key is not used to determine where within the datastore a particular tuple is stored. Thus, in the current example all nodes have a hosting range of the form
- anti-items may be designated in a number of different ways.
- the inclusion of an additional key within the key list is merely a particularly convenient and elegant way of denoting an anti-tuple in the present example.
- Other possibilities include appending a flag to the data item, or modifying a value within meta-data associated with the data item.
- FIG. 6 shows an example of a deletion operation that is intended to delete the item inserted in FIG. 5 .
- the deletion procedure is highly analagous to the insertion procedure.
- a client connects to the only node of rank zero, and requests deletion of the tuple (5, 6, 0). This is accomplished by inserting the corresponding anti-tuple (5, 6, 1).
- the coverage values shown have been altered from FIG. 5 to reflect the inclusion of the additional key within the key list.
- the tuple inserted in FIG. 5 is assumed to have been of the form (5, 6, 0).
- the insertion of the anti-tuple proceeds as the insertion of the tuple in FIG. 5 .
- the anti-tuple (5, 6, 1) arrives for storage at nodes Nb and Nc. Arrival of the anti-tuple at the same location as the tuple results in deletion of the tuple.
- deletion may entail the actual removal of the tuple from storage, which may be performed in several ways. Most simply, upon storage of an anti-tuple the storing node checks for the presence of the corresponding tuple. If the corresponding tuple is present, it is removed from storage. Alternatively, the anti-tuple may be stored alongside the tuple, and optionally removed at a later time through a garbage collection process. In this approach, or in another alternative approach in which the tuple is stored indefinitely, the presence of the anti-tuple alongside the tuple results in the exclusion of the tuple from any subsequent data retrieval operations.
- an anti-tuple may also allow for a wild card or “don't care” key value for one or more of the keys.
- the insertion procedure propagates the anti-tuple (3, *, 1) to all nodes with a hosting range encompassing a key value of 3 for the first key. Arrival at these nodes results in the deletion of all tuples of the form (3, k2, 0), where k2 is a any key value selected from the key K2.
- the tuple is propagated to and delete any matching tuples stored at nodes Nb and Nd.
- a wild card key value could also be used in the insertion process.
- a tuple containing a wild card is propagated to all nodes for which the explicitly specified key values are within the hosting range.
- all tuples within the node's hosting range that match the tuple containing the wild card are stored. This operation results in a broad insertion.
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides an efficient apparatus and method for deleting items within a distributed datastore. Deletion of items is accomplished using anti-items having the same structure as a conventional data item, but for a single tag, flag, or bit which indicates that it is an anti-item, wherein the single tag, flag, or bit but does not affect the location at which a data item or anti-item is ultimately stored within the datastore, thereby ensuring that, upon insertion, the anti-item reaches the same location or locations within the datastore as the original data item.
Description
- This application is a continuation of U.S. patent application Ser. No. 13/208,225, filed Aug. 11, 2011 which is a continuation of U.S. patent application Ser. No. 12/815,156, filed Jun. 14, 2010, now U.S. Pat. No. 8,024,377, issued Sep. 20, 2011, which is a continuation of U.S. Pat. No. 7,774,308, issued Aug. 10, 2010, which claims priority to U.S. Provisional Patent Application Ser. No. 60/636,822, filed Dec. 15, 2004, each of which is incorporated herein in its entirety by this reference thereto.
- 1. Technical Field
- The invention relates to the storage of information. More particularly, the invention relates to an anti-item for deletion of content in a distributed datastore.
- 2. Description of the Prior Art
- In recent years, the need for reliable and efficient storage of large amounts of complex data has increased dramatically. Indeed, the need for extensive storage seems to have outpaced the remarkable advances made in storage technology, e.g. the increasing capacity and decreasing cost of hard disks. As a result, storage of truly large amounts of data on a single server is in many cases impractical, and a distributed approach is desirable. Moreover, even in those cases where storage can be handled by a single machine, a distributed datastore may offer superior reliability and more efficient load handling.
- In many distributed datastores, a single data item may be stored in one or more locations, i.e. on more than one server. In some such systems, the location(s) at which a data item is stored is determined by an insertion procedure in which the inserted item is propagated through a network of servers to the one or more servers that eventually store the data. Such an insertion procedure presents challenges if the need for deletion of data items arises because it may be inconvenient or computationally expensive to determine directly the locations at which a particular data item is stored.
- It would be advantageous to provide an efficient apparatus and method for deleting items within a distributed datastore. In particular, it would be advantageous to provide an apparatus and method of deletion that uses an already well defined procedure for insertion of data.
- The invention provides an efficient apparatus and method for deleting items within a distributed datastore. In particular, the invention provides an apparatus and method of deletion that uses an already well defined procedure for insertion of data.
-
FIG. 1 is a block schematic diagram showing an exemplary distributed datastore according to the invention; -
FIG. 2 is a block schematic diagram showing superior and inferior nodes, and a sense of upstream and downstream according to the invention; -
FIG. 3 is a block schematic diagram showing hosting ranges of the nodes according to the invention; -
FIG. 4 is a block schematic diagram showing coverages of the nodes according to the invention; -
FIG. 5 is a block schematic diagram showing insertion of a tuple according to the invention; and -
FIG. 6 is a block schematic diagram showing insertion of an anti-tuple, i.e. deletion of a tuple, according to the invention. - The invention facilitates the deletion of data items from a distributed datastore via the addition of anti-items using a standard data insertion procedure. Successful operation of the invention is possible in a datastore where:
-
- The data insertion procedure is based upon the data item. Specifically, the location at which an inserted data item is ultimately stored is preferably consistent and is preferably based upon the properties of the inserted data item itself; and
- The data insertion procedure is essentially constant over time. Specifically, the result of the data insertion procedure, i.e. the location(s) to which the inserted item is propagated, is preferably the same when the anti-item is inserted as it was when the original data item was inserted. For purposes of this disclosure, the data insertion procedure also comprises any variant of the term “procedure”, such as a process, algorithm, module, or mechanism. This understanding of the term “procedure” applies likewise to the deletion procedure discussed below.
- The structure of an anti-item is the same as that of a conventional data item, but for a single tag, flag, or bit which indicates that it is an anti-item. Importantly, this additional tag does not affect the location at which a data item or anti-item is ultimately stored within the datastore. These properties ensure that, upon insertion, the anti-item reaches the same location or locations within the datastore as the original data item. After the anti-item has reached these locations, the data item is considered deleted. Deletion may entail the actual removal of both the data item and the anti-item from the datastore. Such annihilations may be executed upon arrival of the anti-item at the storage location or through a periodic, off-line garbage collection process. Alternatively, the anti-item may be forever stored alongside the data item. In this case, the presence of the anti-item alongside the data item excludes the data item from subsequent data retrieval operations.
- The invention is more clearly understood through consideration of an exemplary distributed data-store that satisfies the above characteristics.
- The exemplary datastore consists of multiple nodes connected in a directed, acyclic graph, as shown in
FIG. 1 , in which four interconnected nodes (Na, Nb, Nc, and Nd) are illustrated. Storage of data occurs at nodes, which are preferably servers with caching or hard disk data storage capabilities, or a combination thereof. - A particular installation of the datastore is characterized by a key list containing N keys. Each key within the key list is defined by an ordered list of values vi and an integer k. The integer represents the position of the key within the key list. A key may thus be expressed as
-
Kk={v1, v2, . . . , vi, . . . , vMk}. (1) - Here, M denotes the number of values within the key. In many instances, the ordered list of values is simply a range of integers. For example, a key may be the defined as the integers between 1 and 10, inclusive. That is,
-
Kx=[1, 10]. (2) - Data items within the datastore take the form of tuples of length N, expressed as
-
I=(k1, k2, . . . , kj, . . . , kN), (3) - where kj are key values, selected from the jth key within the key list. Thus, for a key list S defined as
-
S={K1, K2}={[2, 7], [4, 13]}, (4) - and one possible tuple is
-
I=(3, 8). (5) - A key range is a contiguous subset of the indices into the ordered list of values that define a key. A key range is expressed as a pair of integers representing the ends of the range, inclusive. That is,
-
r=[imin, imax]. (6) - The storage duties of each node within the datastore are defined by a hosting range. A hosting range is a set of N key ranges that defines a subset of all tuples that can be expressed using the key list. For example, for the key list of Equation (4), the hosting range
-
H={[2, 3], [9, 10]} (7) - indicates that the node is responsible for storing tuples [2, 9], [2, 10], [3, 9], and [3, 10]. As noted, the storage duties may be fulfilled using a combination of caching and disk storage. Alternatively, and more conveniently, a hosting range may be expressed using a set of tuples defining the corners of the covered region. For example, the hosting range of Equation (7) may be expressed as
-
H={(2, 9), (3, 10)}. (8) - As illustrated in
FIG. 2 , nodes may be characterized by a rank. Nodes having a lower rank are termed inferior, and nodes having a higher rank are termed superior. Nodes may only seek data from superior nodes, as indicated by the direction of the arrows. That is, requests for data may be passed to superior nodes but may not be passed to inferior nodes. - The coverage of a node is the union of the tuples within its hosting range and the tuples within the hosting ranges of the superior nodes to which it is connected. To facilitate this calculation, a node advertises its coverage to the inferior nodes to which it is connected. In the simplest embodiments of the invention, an administrator configures the network of nodes, explicitly indicating the connectivity between nodes, and the hosting ranges of each, and this calculation must be performed once upon system configuration. In more sophisticated distributed datastores, though, the connectivity of nodes and the hosting ranges of the nodes may be adjusted dynamically in response to measured system loads. In such systems, the advertising of coverage occurs on an ongoing basis.
- A node has full coverage when its coverage contains all tuples that may be specified with the key list. For any tuple, a node with full coverage either hosts the tuple itself, or is connected to a superior node that advertises coverage for the tuple. By definition, a node is of rank zero if and only if it has full coverage.
-
FIG. 3 shows a set of possible hosting ranges for the distributed datastore ofFIG. 1 with the key list of Equation (4). The resulting coverages are shown inFIG. 4 . - Insertion of data into the datastore is performed by a client that connects to the datastore. Instructions to insert data are only passed from inferior nodes to superior nodes. Thus, to ensure that any tuple within the key list can be inserted properly, it is required that the client connect only to nodes of rank zero.
-
FIG. 5 shows an example of the data insertion procedure in which the client inserts the tuple (5, 6) at node Na. Because node Na is of rank zero, the inserted tuple is within its coverage. However, the inserted tuple is not within the hosting range of node Na, so node Na does not store the tuple locally. Node Na then considers the coverage of the superior nodes to which it is connected and passes the insertion request to those superior nodes that provide coverage for the inserted tuple. In this case, both Nb and Nc and provide coverage for the tuple (5, 6). Node Nb receives the insertion request. The inserted tuple is within the hosting range of node Nb, so node Nb stores the tuple locally. After storing the tuple locally, node Nb considers the coverage of the superior nodes to which it is connected. The inserted tuple is within the coverage of node Nc but not within the coverage of node Nd. Node Nb therefore passes the insertion request to node Nc but not to node Nd. - Thus, node Nc receives two insertion requests for the tuple (5, 6). Upon receipt of the first insertion request, node Nc determines that the tuple is within its hosting range. The tuple is therefore stored locally. Upon receipt of the second insertion request, node Nc again determines that the tuple is within its hosting range. However, it then notes that the tuple is already within its local storage and therefore ignores the second insertion request. Because node Nc is not connected to any superior nodes, the insertion procedure then terminates.
- The deletion procedure of the current invention is preferably implemented within the exemplary datastore through the addition of a deletion key to the key list. Specifically, the key list is defined as
-
S={K1 , K2 , Kd}={[1, 5], [6, 15], [0, 1]}. (9) - The deletion key Kd is added solely to differentiate tuples from anti-tuples, i.e. items from anti-items. Tuples are of the form (a, b, 0), and all anti-tuples are of the form (c, d, 1). The deletion key is not used to determine where within the datastore a particular tuple is stored. Thus, in the current example all nodes have a hosting range of the form
-
H={(t, v, 0), (u, w, 1)}. (10) - That is, all nodes store both tuples and anti-tuples.
- As described above, anti-items may be designated in a number of different ways. The inclusion of an additional key within the key list is merely a particularly convenient and elegant way of denoting an anti-tuple in the present example. Other possibilities include appending a flag to the data item, or modifying a value within meta-data associated with the data item.
-
FIG. 6 shows an example of a deletion operation that is intended to delete the item inserted inFIG. 5 . The deletion procedure is highly analagous to the insertion procedure. A client connects to the only node of rank zero, and requests deletion of the tuple (5, 6, 0). This is accomplished by inserting the corresponding anti-tuple (5, 6, 1). The coverage values shown have been altered fromFIG. 5 to reflect the inclusion of the additional key within the key list. Similarly, the tuple inserted inFIG. 5 is assumed to have been of the form (5, 6, 0). - The insertion of the anti-tuple proceeds as the insertion of the tuple in
FIG. 5 . Thus, the anti-tuple (5, 6, 1) arrives for storage at nodes Nb and Nc. Arrival of the anti-tuple at the same location as the tuple results in deletion of the tuple. As noted above, deletion may entail the actual removal of the tuple from storage, which may be performed in several ways. Most simply, upon storage of an anti-tuple the storing node checks for the presence of the corresponding tuple. If the corresponding tuple is present, it is removed from storage. Alternatively, the anti-tuple may be stored alongside the tuple, and optionally removed at a later time through a garbage collection process. In this approach, or in another alternative approach in which the tuple is stored indefinitely, the presence of the anti-tuple alongside the tuple results in the exclusion of the tuple from any subsequent data retrieval operations. - Finally, the specification of an anti-tuple may also allow for a wild card or “don't care” key value for one or more of the keys. For example, the insertion procedure propagates the anti-tuple (3, *, 1) to all nodes with a hosting range encompassing a key value of 3 for the first key. Arrival at these nodes results in the deletion of all tuples of the form (3, k2, 0), where k2 is a any key value selected from the key K2. Thus, in the network of
FIG. 4 , the tuple is propagated to and delete any matching tuples stored at nodes Nb and Nd. - The symmetry of the insertion and deletion procedure suggests that a wild card key value could also be used in the insertion process. After insertion, a tuple containing a wild card is propagated to all nodes for which the explicitly specified key values are within the hosting range. Upon arrival at these hosting nodes, all tuples within the node's hosting range that match the tuple containing the wild card are stored. This operation results in a broad insertion.
- Although the invention is described herein with reference to the preferred embodiment, one skilled in the art will readily appreciate that other applications may be substituted for those set forth herein without departing from the spirit and scope of the present invention. For example, the various operations and procedures disclosed herein may be effected by any of software, hardware, and combinations thereof.
- Accordingly, the invention should only be limited by the Claims included below.
Claims (6)
1. A method of excluding a first item from a retrieval operation in a distributed datastore, said method comprising:
inserting a second item into said distributed datastore, wherein said first item was previously inserted into said distributed datastore;
wherein said first item and said second item each comprise a plurality of key values, one key value for each of a plurality of keys, wherein said retrieval operation is specified using a set of keys from said plurality of keys;
wherein said first item and said second item have equal key values for each key within said set of keys; and
wherein insertion of said second item within said distributed data-store excludes said first item from said retrieval operation.
2. The method of claim 1 , wherein said plurality of keys comprises a binary indicator in the form of a deletion key, wherein a key value of said deletion key distinguishes said first item and said second item from one another, and wherein said deletion key is not within said set of keys.
3. The method of claim 1 , additionally comprising the step of:
removing said first item and said second item from said distributed datastore immediately upon insertion of said second item into said distributed datastore.
4. The method of claim 1 , additionally comprising the step of:
executing an offline garbage collection process to remove said first item and said second item from said distributed datastore substantially after insertion of said second item into said distributed datastore.
5. The method of claim 1 , wherein said plurality of key values are numeric.
6. The method of claim 1 , wherein said second item comprises a wild card key value corresponding to any and all valid key values.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/361,831 US20120131023A1 (en) | 2004-12-15 | 2012-01-30 | Anti-Item for Deletion of Content In A Distributed Datastore |
Applications Claiming Priority (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US63682204P | 2004-12-15 | 2004-12-15 | |
US11/177,789 US7774308B2 (en) | 2004-12-15 | 2005-07-08 | Anti-item for deletion of content in a distributed datastore |
US12/815,156 US8024377B2 (en) | 2004-12-15 | 2010-06-14 | Anti-item for deletion of content in a distributed datastore |
US13/208,225 US8131781B2 (en) | 2004-12-15 | 2011-08-11 | Anti-item for deletion of content in a distributed datastore |
US13/361,831 US20120131023A1 (en) | 2004-12-15 | 2012-01-30 | Anti-Item for Deletion of Content In A Distributed Datastore |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/208,225 Continuation US8131781B2 (en) | 2004-12-15 | 2011-08-11 | Anti-item for deletion of content in a distributed datastore |
Publications (1)
Publication Number | Publication Date |
---|---|
US20120131023A1 true US20120131023A1 (en) | 2012-05-24 |
Family
ID=46124040
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/177,789 Expired - Fee Related US7774308B2 (en) | 2004-12-15 | 2005-07-08 | Anti-item for deletion of content in a distributed datastore |
US12/815,156 Active US8024377B2 (en) | 2004-12-15 | 2010-06-14 | Anti-item for deletion of content in a distributed datastore |
US13/208,225 Active US8131781B2 (en) | 2004-12-15 | 2011-08-11 | Anti-item for deletion of content in a distributed datastore |
US13/361,831 Abandoned US20120131023A1 (en) | 2004-12-15 | 2012-01-30 | Anti-Item for Deletion of Content In A Distributed Datastore |
Family Applications Before (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/177,789 Expired - Fee Related US7774308B2 (en) | 2004-12-15 | 2005-07-08 | Anti-item for deletion of content in a distributed datastore |
US12/815,156 Active US8024377B2 (en) | 2004-12-15 | 2010-06-14 | Anti-item for deletion of content in a distributed datastore |
US13/208,225 Active US8131781B2 (en) | 2004-12-15 | 2011-08-11 | Anti-item for deletion of content in a distributed datastore |
Country Status (1)
Country | Link |
---|---|
US (4) | US7774308B2 (en) |
Families Citing this family (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8996486B2 (en) * | 2004-12-15 | 2015-03-31 | Applied Invention, Llc | Data store with lock-free stateless paging capability |
US7774308B2 (en) * | 2004-12-15 | 2010-08-10 | Applied Minds, Inc. | Anti-item for deletion of content in a distributed datastore |
US8275804B2 (en) | 2004-12-15 | 2012-09-25 | Applied Minds, Llc | Distributed data store with a designated master to ensure consistency |
US11321408B2 (en) | 2004-12-15 | 2022-05-03 | Applied Invention, Llc | Data store with lock-free stateless paging capacity |
US9015126B2 (en) | 2010-05-22 | 2015-04-21 | Nokia Corporation | Method and apparatus for eventually consistent delete in a distributed data store |
US8938430B2 (en) * | 2012-02-22 | 2015-01-20 | International Business Machines Corporation | Intelligent data archiving |
US10846275B2 (en) * | 2015-06-26 | 2020-11-24 | Pure Storage, Inc. | Key management in a storage device |
CN108093273B (en) * | 2016-11-22 | 2020-10-02 | 北京国双科技有限公司 | Data sorting method, device and system |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7313581B1 (en) * | 1999-04-29 | 2007-12-25 | International Business Machines Corporation | Method for deferred deletion of entries for a directory service backing store |
Family Cites Families (48)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4933936A (en) * | 1987-08-17 | 1990-06-12 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Distributed computing system with dual independent communications paths between computers and employing split tokens |
EP0578207B1 (en) * | 1992-07-06 | 1999-12-01 | Microsoft Corporation | Method for naming and binding objects |
US5454101A (en) * | 1992-09-15 | 1995-09-26 | Universal Firmware Industries, Ltd. | Data storage system with set lists which contain elements associated with parents for defining a logical hierarchy and general record pointers identifying specific data sets |
US5870764A (en) * | 1993-05-12 | 1999-02-09 | Apple Computer, Inc. | Method of managing a data structure for concurrent serial and parallel revision of a work |
US5694593A (en) * | 1994-10-05 | 1997-12-02 | Northeastern University | Distributed computer database system and method |
US5799322A (en) * | 1995-01-24 | 1998-08-25 | Tandem Computer, Inc. | System and method for stopping updates at a specified timestamp in a remote duplicate database facility |
US5924090A (en) * | 1997-05-01 | 1999-07-13 | Northern Light Technology Llc | Method and apparatus for searching a database of records |
US6115705A (en) * | 1997-05-19 | 2000-09-05 | Microsoft Corporation | Relational database system and method for query processing using early aggregation |
SE510001C2 (en) * | 1997-07-21 | 1999-03-29 | Ericsson Telefon Ab L M | Method for storing elements in a database |
US6026413A (en) * | 1997-08-01 | 2000-02-15 | International Business Machines Corporation | Determining how changes to underlying data affect cached objects |
US20020036617A1 (en) * | 1998-08-21 | 2002-03-28 | Timothy R. Pryor | Novel man machine interfaces and applications |
US6018524A (en) * | 1997-09-09 | 2000-01-25 | Washington University | Scalable high speed IP routing lookups |
US6016489A (en) * | 1997-12-18 | 2000-01-18 | Sun Microsystems, Inc. | Method and apparatus for constructing stable iterators in a shared data collection |
US7760187B2 (en) * | 2004-07-30 | 2010-07-20 | Apple Inc. | Visual expander |
US6460051B1 (en) * | 1998-10-28 | 2002-10-01 | Starfish Software, Inc. | System and methods for synchronizing datasets in a communication environment having high-latency or other adverse characteristics |
US6484161B1 (en) * | 1999-03-31 | 2002-11-19 | Verizon Laboratories Inc. | Method and system for performing online data queries in a distributed computer system |
US7047242B1 (en) * | 1999-03-31 | 2006-05-16 | Verizon Laboratories Inc. | Weighted term ranking for on-line query tool |
US6578131B1 (en) * | 1999-04-27 | 2003-06-10 | Microsoft Corporation | Scaleable hash table for shared-memory multiprocessor system |
US7152165B1 (en) * | 1999-07-16 | 2006-12-19 | Intertrust Technologies Corp. | Trusted storage systems and methods |
US6442565B1 (en) * | 1999-08-13 | 2002-08-27 | Hiddenmind Technology, Inc. | System and method for transmitting data content in a computer network |
US7089240B2 (en) * | 2000-04-06 | 2006-08-08 | International Business Machines Corporation | Longest prefix match lookup using hash function |
US7752214B2 (en) * | 2000-09-01 | 2010-07-06 | Op40, Inc. | Extended environment data structure for distributed digital assets over a multi-tier computer network |
JP4595182B2 (en) * | 2000-09-07 | 2010-12-08 | ソニー株式会社 | Information recording apparatus, information reproducing apparatus, information recording method, information reproducing method, information recording medium, and program providing medium |
US7136486B2 (en) * | 2000-09-11 | 2006-11-14 | Seiko Epson Corporation | Print system and printer capable of prevention of unjust copy print |
JP2002132547A (en) * | 2000-10-27 | 2002-05-10 | Fuji Xerox Co Ltd | Server for electronics information control, client therefor, method therefor and readable record medium recording program therefor |
US6704745B2 (en) * | 2000-12-11 | 2004-03-09 | Microsoft Corporation | Transforming data between first organization in a data store and hierarchical organization in a dataset |
US6904454B2 (en) * | 2001-03-21 | 2005-06-07 | Nokia Corporation | Method and apparatus for content repository with versioning and data modeling |
US7099885B2 (en) * | 2001-05-25 | 2006-08-29 | Unicorn Solutions | Method and system for collaborative ontology modeling |
US6876656B2 (en) * | 2001-06-15 | 2005-04-05 | Broadcom Corporation | Switch assisted frame aliasing for storage virtualization |
US7054867B2 (en) * | 2001-09-18 | 2006-05-30 | Skyris Networks, Inc. | Systems, methods and programming for routing and indexing globally addressable objects and associated business models |
KR100449708B1 (en) * | 2001-11-16 | 2004-09-22 | 삼성전자주식회사 | Flash memory management method |
US7080088B1 (en) * | 2002-01-30 | 2006-07-18 | Oracle International Corporation | Automatic reconciliation of bindable objects |
US7281024B1 (en) * | 2002-11-12 | 2007-10-09 | Cisco Technology, Inc. | Approach for propagating changes from a database to a client |
AU2002953555A0 (en) * | 2002-12-23 | 2003-01-16 | Canon Kabushiki Kaisha | Method for presenting hierarchical data |
US7290019B2 (en) * | 2003-03-03 | 2007-10-30 | Microsoft Corporation | Garbage collection of tombstones for optimistic replication systems |
GB0313619D0 (en) * | 2003-06-12 | 2003-07-16 | Symbian Ltd | A method of automatically analysing the structure of a software system |
US6956827B2 (en) * | 2003-08-15 | 2005-10-18 | Popular Telephony, Inc. | Distribution of identifiers in serverless networks |
US7512638B2 (en) * | 2003-08-21 | 2009-03-31 | Microsoft Corporation | Systems and methods for providing conflict handling for peer-to-peer synchronization of units of information manageable by a hardware/software interface system |
US7400577B2 (en) * | 2004-02-25 | 2008-07-15 | Microsoft Corporation | Methods and systems for streaming data |
US8688634B2 (en) * | 2004-02-27 | 2014-04-01 | International Business Machines Corporation | Asynchronous peer-to-peer data replication |
US8880502B2 (en) * | 2004-03-15 | 2014-11-04 | International Business Machines Corporation | Searching a range in a set of values in a network with distributed storage entities |
US7340453B2 (en) * | 2004-07-30 | 2008-03-04 | International Business Machines Corporation | Microeconomic mechanism for distributed indexing |
US7778984B2 (en) * | 2004-11-19 | 2010-08-17 | Microsoft Corporation | System and method for a distributed object store |
US8996486B2 (en) * | 2004-12-15 | 2015-03-31 | Applied Invention, Llc | Data store with lock-free stateless paging capability |
US7774308B2 (en) * | 2004-12-15 | 2010-08-10 | Applied Minds, Inc. | Anti-item for deletion of content in a distributed datastore |
US7590635B2 (en) * | 2004-12-15 | 2009-09-15 | Applied Minds, Inc. | Distributed data store with an orderstamp to ensure progress |
US20060267998A1 (en) * | 2005-05-24 | 2006-11-30 | Walls Jeffrey J | Systems and methods for management of parameters in a multi-node graphics system |
US20070174483A1 (en) * | 2006-01-20 | 2007-07-26 | Raj Alex E | Methods and apparatus for implementing protection for multicast services |
-
2005
- 2005-07-08 US US11/177,789 patent/US7774308B2/en not_active Expired - Fee Related
-
2010
- 2010-06-14 US US12/815,156 patent/US8024377B2/en active Active
-
2011
- 2011-08-11 US US13/208,225 patent/US8131781B2/en active Active
-
2012
- 2012-01-30 US US13/361,831 patent/US20120131023A1/en not_active Abandoned
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7313581B1 (en) * | 1999-04-29 | 2007-12-25 | International Business Machines Corporation | Method for deferred deletion of entries for a directory service backing store |
Non-Patent Citations (1)
Title |
---|
Wade, September 1999, Lancaster University, An Investigation into the use of the Tuple Space Paradigm in Mobile Computing Environments * |
Also Published As
Publication number | Publication date |
---|---|
US20110302223A1 (en) | 2011-12-08 |
US20100312804A1 (en) | 2010-12-09 |
US8024377B2 (en) | 2011-09-20 |
US8131781B2 (en) | 2012-03-06 |
US7774308B2 (en) | 2010-08-10 |
US20060129517A1 (en) | 2006-06-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8131781B2 (en) | Anti-item for deletion of content in a distributed datastore | |
AU757667B2 (en) | Access to content addressable data over a network | |
US8074289B1 (en) | Access to content addressable data over a network | |
US6665675B1 (en) | Shared file system having a token-ring style protocol for managing meta-data | |
US6154764A (en) | On-line forum-type electronic conference system maintaining consistency of messages | |
US6516320B1 (en) | Tiered hashing for data access | |
US9336227B2 (en) | Selective synchronization in a hierarchical folder structure | |
US7856436B2 (en) | Dynamic holds of record dispositions during record management | |
US20020122543A1 (en) | System and method of indexing unique electronic mail messages and uses for the same | |
EP0974895A2 (en) | System for user control of version synchronization in mobile computing | |
US7584264B2 (en) | Data storage and retrieval systems and related methods of storing and retrieving data | |
US7054887B2 (en) | Method and system for object replication in a content management system | |
WO2001013232A3 (en) | Self-healing computer system storage | |
CN108008918A (en) | Data processing method, memory node and distributed memory system | |
CN106326239A (en) | Distributed file system and file meta-information management method thereof | |
US7080102B2 (en) | Method and system for migrating data while maintaining hard links | |
US6952699B2 (en) | Method and system for migrating data while maintaining access to data with use of the same pathname | |
AU2002351296B2 (en) | System and method for processing a request using multiple database units | |
US7424015B2 (en) | Method of managing forwarding tables of network processors based on address learning in line card | |
US20180189342A1 (en) | Method and system for tree management of trees under multi-version concurrency control | |
US7058773B1 (en) | System and method for managing data in a distributed system | |
US8982886B2 (en) | Memory saving packet modification | |
US20060236071A1 (en) | Method and system for optimizing operations on memory device | |
US20050131908A1 (en) | Browsing a list of data items | |
WO2023160040A1 (en) | Data processing method and apparatus based on blockchain, and device and readable storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |
|
AS | Assignment |
Owner name: APPLIED INVENTION, LLC, CALIFORNIA Free format text: NUNC PRO TUNC ASSIGNMENT;ASSIGNOR:APPLIED MINDS, LLC;REEL/FRAME:034750/0495 Effective date: 20150109 |