Error-Correcting Data Structures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Error-Correcting Data Structures

Ronald de Wolf
  • Function : Author
  • PersonId : 857853


We study data structures in the presence of adversarial noise. We want to encode a given ob ject in a succinct data structure that enables us to efficiently answer specific queries about the ob ject, even if the data structure has been corrupted by a constant fraction of errors. This new model is the common generalization of (static) data structures and locally decodable error-correcting codes. The main issue is the tradeoff between the space used by the data structure and the time (number of probes) needed to answer a query about the encoded ob ject. We prove a number of upper and lower bounds on various natural error-correcting data structure problems. In particular, we show that the optimal length of error-correcting data structures for the Membership problem (where we want to store subsets of size s from a universe of size n) is closely related to the optimal length of locally decodable codes for s-bit strings.
Fichier principal
Vignette du fichier
ecdata-stacs_new.pdf (228.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00359651 , version 1 (09-02-2009)


  • HAL Id : inria-00359651 , version 1


Ronald de Wolf. Error-Correcting Data Structures. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.313-324. ⟨inria-00359651⟩


44 View
101 Download


Gmail Facebook Twitter LinkedIn More