A Dynamic Space-Efficient Filter with Constant Time Operations

by   Ioana Oriana Bercea, et al.

A dynamic dictionary is a data structure that maintains sets of cardinality at most n from a given universe and supports insertions, deletions, and membership queries. A filter approximates membership queries with a one-sided error that occurs with probability at most ϵ. The goal is to obtain dynamic filters that are space-efficient (the space is 1+o(1) times the information-theoretic lower bound) and support all operations in constant time with high probability. One approach to designing filters is to reduce to the retrieval problem. When the size of the universe is polynomial in n, this approach yields a space-efficient dynamic filter as long as the error parameter ϵ satisfies log(1/ϵ) = ω(loglog n). For the case that log(1/ϵ) = O(loglog n), we present the first space-efficient dynamic filter with constant time operations in the worst case (whp). In contrast, the space-efficient dynamic filter of Pagh, Pagh, Rao (SODA 2005) supports insertions and deletions in amortized expected constant time. Our approach employs the classic reduction of Carter et al. (STOC 1978) on a new type of dictionary construction that supports random multisets.


page 1

page 2

page 3

page 4


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

We consider the dynamic dictionary problem for multisets. Given an upper...

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

A fully-dynamic dictionary is a data structure for maintaining sets that...

Succinct Filters for Sets of Unknown Sizes

The membership problem asks to maintain a set S⊆[u], supporting insertio...

An Optimal Choice Dictionary

A choice dictionary is a data structure that can be initialized with a p...

Small Uncolored and Colored Choice Dictionaries

A choice dictionary can be initialized with a parameter n∈N and subseque...

Skyline Queries in O(1) time?

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

Dynamic smooth compressed quadtrees (Fullversion)

We introduce dynamic smooth (a.k.a. balanced) compressed quadtrees with ...