Computer storage and retrieval mechanisms using distributed probabilistic counting

Abstract

Techniques for computer storage and retrieval mechanisms using distributed probabilistic counting are provided. In one technique, multiple probabilistic data structures (PDSs), each corresponding to a different time range of a plurality of time ranges, are stored. A query is received that includes a key value and a time window. In response to receiving the query, multiple sub-queries are generated, each of which includes the key value and corresponds to a different time range of the time window. Each sub-query corresponds to a different PDS of the multiple PDSs. For each of the multiple sub-queries, that sub-query is executed against the PDS that corresponds to the sub-query. The executing comprises receiving results from the PDS. The results from the multiple sub-queries are aggregated to generate an aggregated result. The query is responded to with the aggregated result.

Dependencies are inferred from the claim text.