Multi-level nested open hashed data stores
First Claim
Patent Images
1. A method for storing data comprising:
- arranging a plurality of data buckets in a logical inverted tree structure having a plurality of levels; and
performing nested hashing at each level of the plurality of levels.
2 Assignments
0 Petitions
Accused Products
Abstract
A method for storing data. A method for storing data comprising arranging a plurality of data buckets in a logical inverted tree structure having a plurality of levels; and performing nested hashing at each level of the plurality of levels.
-
Citations
21 Claims
-
1. A method for storing data comprising:
-
arranging a plurality of data buckets in a logical inverted tree structure having a plurality of levels; and
performing nested hashing at each level of the plurality of levels. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method for storing data comprising:
-
forming a forest of name spaces for accessing a plurality of data stores; and
forming the plurality of data stores by multi-level nested open hashing. - View Dependent Claims (7, 8, 9, 10, 11)
-
-
12. A method of forming a balanced memory tree comprising:
-
hashing a first hashkey and a bucket ID to produce a first evenly distributed n-state number;
using the first n-state number as an index to point to a storage bucket;
hashing a second hashkey and a bucket ID to produce a second evenly distributed n-state number;
using the second n-state number as an index to point to an overflow storage bucket. - View Dependent Claims (13)
-
-
14. A digital rights management system comprising:
-
a multi-level nested open hashed data store;
a CE device having the multi-level nested open hashed data store to store a data file;
a service provider coupled to the CE device to provide data files to the CE device. - View Dependent Claims (15, 16, 17, 18)
-
-
19. A method of populating a multi-level nested open hashed data store comprising:
-
filling a current data bucket having a fixed size with a portion of data from a data record;
hashing a current bucket ID with a data hashkey;
creating a child bucket if one does not exist;
storing a portion of the data record in the child bucket repeating the process of populating a multi-level nested open hashed data store until all of the data from the data record has been stored in a plurality of child buckets. - View Dependent Claims (20, 21)
-
Specification