Back to results
US 9,760,625 B2Granted
Method and system for indexing in datastores
AssigneeDeep Information Sciences, Inc.
InventorsThomas Hazel, Jason P. Jeffords, Gerard L. Buteau
Life of this patent
Estimating the term…
Abstract
A method, system, apparatus, and computer program product for indexing information stored in data-stores. The system receives a new index request. The system creates an index in response to the request. The new index includes at least one segment, a first flag, and a last flag. Each segment comprises index summary information. The system then stores the index in memory.
Claims27
A computer assisted method for indexing information stored in a data-store as a segment tree, the method including:
- receiving a new index request for the segment tree driven by at least one of a create operation, a read operation, an update operation, and a delete operation;
- creating an index in response to the new index request, the index comprising at least one segment, a first flag, and a last flag, wherein each segment comprises index summary information, wherein the index summary information comprises at least one selected from a group consisting of a covered key range within the segment, a start key within a next segment, and key summary filters;
- and
- storing the index in memory;
- organizing an index file, wherein organizing includes at least one of splitting a segment and merging a segment;
- covering a key space by indicating at least a first key and a next segment key in each segment and summary segment;
- indicating a deleted first key within a segment and a summary segment;
- maintaining a covered key space during organization operations;
- and
- streaming index changes to an index file in an append-only manner.
7 more elements
An automated system for indexing information stored in a data-store as a segment tree, the system comprising:
- means for receiving a new index request for the segment tree driven by at least one of a create operation, a read operation, an update operation, and a delete operation;
- means for creating an index in response to the new index request, the index comprising at least one segment, a first flag, and a last flag, wherein each segment comprises index summary information, wherein the index summary information comprises at least one selected from a group consisting of a covered key range within the segment, a start key within a next segment, and key summary filters;
- and
- means for storing the index in memory;
- means for organizing an index file, wherein organizing includes at least one of splitting a segment and merging a segment;
- means for covering a key space by indicating at least a first key and a next segment key in each segment and summary segment;
- means for indicating a deleted first key within a segment and a summary segment;
- means for maintaining a covered key space during organization operations;
- and
- means for streaming index changes to an index file in an append-only manner.
7 more elements
A computer program product comprising a non-transitory computer readable medium having control logic stored therein for causing a computer to perform indexing information stored in a data-store as a segment tree, the control logic code for:
- receiving a new index request for the segment tree driven by at least one of a create operation, a read operation, an update operation, and a delete operation;
- creating an index in response to the new index request, the index comprising at least one segment, a first flag, and a last flag, wherein each segment comprises index summary information, wherein the index summary information comprises at least one selected from a group consisting of a covered key range within the segment, a start key within a next segment, and key summary filters;
- and
- storing the index in memory;
- organizing an index file, wherein organizing includes at least one of splitting a segment and merging a segment;
- covering a key space by indicating at least a first key and a next segment key in each segment and summary segment;
- indicating a deleted first key within a segment and a summary segment;
- maintaining a covered key space during organization operations;
- and
- streaming index changes to an index file in an append-only manner.
7 more elements
An automated system for indexing information stored in a data-store as a segment tree, the system comprising:
- at least one processor;
- a user interface functioning via the at least one processor;
- and
- a repository accessible by the at least one processor;
- wherein the at least one processor is configured to:
- receive a new index request for the segment tree driven by at least one of a create operation, a read operation, an update operation, and a delete operation;
- create an index in response to the new index request, the index comprising at least one segment, a first flag, and a last flag, wherein each segment comprises index summary information, wherein the index summary information comprises at least one selected from a group consisting of a covered key range within the segment, a start key within a next segment, and key summary filters;
- and
- store the index in memory;
- organizing an index file, wherein organizing includes at least one of splitting a segment and merging a segment;
- covering a key space by indicating at least a first key and a next segment key in each segment and summary segment;
- indicating a deleted first key within a segment and a summary segment;
- maintaining a covered key space during organization operations;
- and
- streaming index changes to an index file in an append-only manner.
12 more elements
Dependencies are inferred from the claim text.