Dynamic Filter and Retrieval with One Access to Modifiable Memory

Ioana O. Bercea, Guy Even, Tomer Even, Gabriel Marques Domingues

Abstract: We present two constant-time dynamic data-structures that support insertions, deletions, and queries with one-sided errors: a space-efficient dynamic (key-only) filter and a compact dynamic data-structure that combines retrieval and filtering (called a key-value filter). A one-sided error occurs when a query for a key not in the dataset is issued and the outcome is wrong, i.e., a “yes” in a filter or a non-null in the key-value filter. The response to a query with a key in the dataset always returns the correct answer, i.e., a “yes” in a filter and the correct value in a key-value filter. The probability of the one-sided error in our data-structures is \(\varOmega (1/\textsf{poly}(\log n))\), where n is the maximum cardinality of the dataset, and the probability space is over the random bits of the data-structure (i.e., random choice of hash function). The computational framework is the Word RAM model.

External IDs:dblp:conf/ciac/BerceaEED25