One-Probe Search

Forfattere

  • Anna Östlin
  • Rasmus Pagh

DOI:

https://doi.org/10.7146/brics.v9i9.21727

Resumé

We consider dictionaries that perform lookups by probing a single word of memory, knowing only the size of the data structure. We describe a randomized dictionary where a lookup returns the correct answer with probability 1 - epsilon, and otherwise returns "don't know''. The lookup procedure uses an expander graph to select the memory location to probe. Recent explicit expander constructions are shown to yield space usage much smaller than what would be required using a deterministic lookup procedure. Our data structure supports efficient deterministic updates, exhibiting new probabilistic guarantees on dictionary running time.

Downloads

Publiceret

2002-02-05

Citation/Eksport

Östlin, A., & Pagh, R. (2002). One-Probe Search. BRICS Report Series, 9(9). https://doi.org/10.7146/brics.v9i9.21727

Nummer

Nr. 9 (2002): RS-9 One-Probe Search

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).