Pure Storage, Inc.
DYNAMICALLY RESIZABLE STRUCTURES FOR APPROXIMATE MEMBERSHIP QUERIES

Abstract:

A method for efficiently supporting deletion in a probabilistic data structure, and related computing or storage system are described. A processor, computing system or storage system constructs a table and a summary table for determining whether there is an entry for a value in the table. The summary table has buckets pointed to by address fields of values. Each bucket has a prefix table, a transit table, signature table and a first indicator. The system tracks deletion and addition of items of the table and summary table through the first indicators.