Providing an index for a data store
First Claim
Patent Images
1. A method executed by a computer, comprising:
- storing chunks in a data store, wherein respective collections of chunks form respective files;
providing an index that maps subsets of digests of chunks to pages containing information for recreating the chunks, wherein the index is stored in a persistent storage;
maintaining the index in plural slice files in the persistent storage;
mapping, by the computer, a first portion of a given one of the digest subsets to one of the plural slice files; and
mapping, by the computer, a second portion of the given one of the digest subsets to one of plural rows of the one slice file.
2 Assignments
0 Petitions
Accused Products
Abstract
Chunks are stored in a data store, where respective collections of chunks form respective files. An index that maps digests of chunks to pages containing information to recreate the chunks is provided, where the index is stored in persistent storage.
81 Citations
20 Claims
-
1. A method executed by a computer, comprising:
-
storing chunks in a data store, wherein respective collections of chunks form respective files; providing an index that maps subsets of digests of chunks to pages containing information for recreating the chunks, wherein the index is stored in a persistent storage; maintaining the index in plural slice files in the persistent storage; mapping, by the computer, a first portion of a given one of the digest subsets to one of the plural slice files; and mapping, by the computer, a second portion of the given one of the digest subsets to one of plural rows of the one slice file. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A method executed by a computer, comprising:
-
storing chunks in a data store, wherein respective collections of chunks form respective files; providing an index that maps subsets of digests of chunks to pages containing information for recreating the chunks, wherein the index is stored in a persistent storage, wherein a subset of each of the digests is less than an entirety of the corresponding digest; and providing, by the computer, a collision data structure that contains entries for certain nodes that are to be written to the persistent storage, wherein the certain nodes are associated with subsets of the digests that match subsets already in the index. - View Dependent Claims (12, 13, 14, 15, 16, 17)
-
-
18. A method executed by a computer, comprising:
-
storing chunks in a data store, wherein respective collections of chunks form respective files; providing an index that maps digests of chunks to pages containing information for recreating the chunks, wherein the index is stored in a persistent storage; receiving a query to determine if a plurality of nodes exist in the data store; utilizing a first mechanism in the computer to determine, without accessing the index in the persistent storage, that each of a first subset of the plurality of nodes is not in the data store; utilizing a second mechanism in the computer to determine, without accessing the index in the persistent storage, a corresponding page possibly associated with each of a second subset of the plurality of nodes; ensuring that a particular page possibly associated with a particular node in the second subset is loaded; indicating, based on the ensuring, that the particular node does not exist in the data store; and only for a third subset of the plurality of nodes whose existence in the data store is still unknown, utilizing the index on the persistent storage to determine whether each of the third subset of nodes exists in the data store.
-
-
19. A method executed in a computer, comprising:
-
providing, in a data store, an index that maps digests of chunks to pages containing the chunks, wherein collections of chunks form respective files; in response to a first query to determine whether a first digest representing a first chunk is present in the data store, loading one of the pages from persistent storage to temporary storage; according to updated information in the temporary storage resulting from loading of the one page, providing a response to a second query to determine whether a second digest representing a second chunk is in the data store; storing the index as plural index slice files in a persistent storage; mapping a first portion of a given one of the digests to a particular one of the index slice files; and mapping a second portion of the given digest to one of plural rows of the particular index slice file.
-
-
20. A computer-readable storage medium storing instructions that upon execution cause a computer to:
-
store chunks in a data store, wherein respective collections of chunks form respective files; provide an index that maps subsets of digests of chunks to pages containing information for recreating the chunks, wherein the index is stored in a persistent storage; maintain the index in plural slice files in the persistent storage; and map a first portion of a given one of the digest subsets to one of the plural slice files; and map a second portion of the given one of the digest subsets to one of plural rows of the one slice file.
-
Specification