| CPC G06F 16/24537 (2019.01) [G06F 16/284 (2019.01); G06F 16/24573 (2019.01)] | 20 Claims |
|
19. A method, implemented in a computing system comprising at least one memory and one or more hardware processor units coupled to the at least one memory; the method comprising:
receiving a set of sorted unique values in a dataset sorted according to a sorting criterion, the dataset being data stored in at least one computer-implemented data structure;
for values of the set of sorted unique values, determining a plurality of gaps between at least a portion of the values of the set of sorted unique values;
representing the set of unique values as a gap filter, the gap filter comprising: (1) a starting value of the set of sorted unique values, (2) a set of gap lengths for the plurality of gaps, wherein a gap length corresponds to a number of consecutive unique values that are represented as not present in the dataset; and (3) identifiers indicating a number of unique values that are represented as present in the dataset between a unique value corresponding to an ending value of a first gap and a starting value of a second gap;
receiving a computer-implemented data retrieval request requesting information in the dataset, the computer-implemented data retrieval request specifying at least one value;
in response to the computer-implemented data retrieval request, receiving a request to determine the at least one value may be present in the dataset;
determining from the gap filter whether the at least one value may be present in the dataset; and
when the gap filter indicates the at least one value may be present in the dataset, loading at least a portion of the dataset from the at least one computer-implemented data structure for use in processing the computer-implemented data retrieval request, wherein the at least a portion of the dataset is not loaded if the gap filter indicates that the at least one value may not be present in the dataset, thus improving computing efficiency.
|