Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses

11/12/2019
by   Ioana O. Bercea, et al.
0

A fully-dynamic dictionary is a data structure for maintaining sets that supports insertions, deletions and membership queries. A filter approximates membership queries with a one-sided error. We present two designs: 1. The first space-efficient fully-dynamic dictionary that maintains both sets and random multisets and supports queries, insertions, and deletions with a constant number of memory accesses in the worst case with high probability. The comparable dictionary of Arbitman, Naor, and Segev [FOCS 2010] works only for sets. 2. By a reduction from our dictionary for random multisets, we obtain a space-efficient fully-dynamic filter that supports queries, insertions, and deletions with a constant number of memory accesses in the worst case with high probability (as long as the false positive probability is 2^-O(w), where w denotes the word length). This is the first in-memory space-efficient fully-dynamic filter design that provably achieves these properties. We also present an application of the techniques used to design our dictionary to the static Retrieval Problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2020

A Dynamic Space-Efficient Filter with Constant Time Operations

A dynamic dictionary is a data structure that maintains sets of cardinal...
research
05/05/2020

A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations

We consider the dynamic dictionary problem for multisets. Given an upper...
research
04/26/2020

Succinct Filters for Sets of Unknown Sizes

The membership problem asks to maintain a set S⊆[u], supporting insertio...
research
09/20/2018

Small Uncolored and Colored Choice Dictionaries

A choice dictionary can be initialized with a parameter n∈N and subseque...
research
01/09/2020

Age-Partitioned Bloom Filters

Bloom filters (BF) are widely used for approximate membership queries ov...
research
06/14/2019

Dynamic Path-Decomposed Tries

A keyword dictionary is an associative array whose keys are strings. Rec...
research
09/12/2017

Skyline Queries in O(1) time?

The skyline of a set P of points (SKY(P)) consists of the "best" points ...

Please sign up or login with your details

Forgot password? Click here to reset