Lossy Dictionaries

Forfattere

  • Rasmus Pagh
  • Flemming Friche Rodler

DOI:

https://doi.org/10.7146/brics.v8i33.21693

Resumé

Bloom filtering is an important technique for space efficient storage of a conservative approximation of a set S. The set stored may have up to some specified number of "false positive'' members, but all elements of S are included. In this paper we consider lossy dictionaries that are also allowed to have "false negatives'', i.e., leave out elements of S. The aim is to maximize the weight of included keys within a given space constraint. This relaxation allows a very fast and simple data structure making almost optimal use of memory. Being more time efficient than Bloom filters, we believe our data structure to be well suited for replacing Bloom filters in some applications. Also, the fact that our data structure supports information associated to keys paves the way for new uses, as illustrated by an application in lossy image compression.

Downloads

Publiceret

2001-08-04

Citation/Eksport

Pagh, R., & Rodler, F. F. (2001). Lossy Dictionaries. BRICS Report Series, 8(33). https://doi.org/10.7146/brics.v8i33.21693

Nummer

Nr. 33 (2001): RS-33 Lossy Dictionaries

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).