Locating data in a set with a single index using multiple property values
AssigneeInternational Business Machines Corporation
InventorsPatrick J. McKenna, David P. O'Connor, Claude N. Warren, Jr.
Life of this patent
Estimating the term…
Abstract
Indexing objects in a datastore, where the objects are characterized by a set of object properties. For objects from a datastore: a Bloom filter for the object properties, based on a predetermined Bloom filter configuration, is created; the Hamming value of the Bloom filter is determined; a binary logarithm of the Bloom filter is calculated; and the Bloom filter, the Hamming value, the binary logarithm, and a representation of the object is stored in the datastore.
Claims20
A computer-implemented method for indexing objects in a datastore, wherein the objects are characterized by a set of object properties, the method comprising:
- for one or more objects from a datastore:
- creating, by a computer, a Bloom filter for the object properties, based on a predetermined Bloom filter configuration;
- determining, by the computer, a Hamming value of the Bloom filter;
- calculating, by the computer, a binary logarithm of the Bloom filter;
- and
- storing, by the computer, the Bloom filter, the Hamming value, the binary logarithm, and a representation of the object in the datastore.
A computer system for indexing objects in a datastore, wherein the objects are characterized by a set of object properties, the computer system comprising:
- one or more computer processors, one or more non-transitory computer-readable storage media, and program instructions stored on one or more of the computer-readable storage media for execution by at least one of the one or more processors, the one or more processors performing a method comprising:
- for one or more objects from a datastore:
- creating a Bloom filter for the object properties, based on a predetermined Bloom filter configuration;
- determining a Hamming value of the Bloom filter;
- calculating a binary logarithm of the Bloom filter;
- and
- storing the Bloom filter, the Hamming value, the binary logarithm, and a representation of the object in the datastore.
A computer program product for indexing objects in a datastore, wherein the objects are characterized by a set of object properties, the computer program product comprising:
- one or more non-transitory computer-readable storage media and program instructions stored on the one or more computer-readable storage media capable of performing a method, the method comprising:
- for one or more objects from a datastore:
- creating a Bloom filter for the object properties, based on a predetermined Bloom filter configuration;
- determining a Hamming value of the Bloom filter;
- calculating a binary logarithm of the Bloom filter;
- and
- storing the Bloom filter, the Hamming value, the binary logarithm, and a representation of the object in the datastore.
Dependencies are inferred from the claim text.