Tables should be sorted (on random access machines)

Forfattere

  • Faith Fich
  • Peter Bro Miltersen

DOI:

https://doi.org/10.7146/brics.v2i26.19928

Resumé

We consider the problem of storing an n element subset S of a universe
of size m, so that membership queries (is x in S?) can be answered
efficiently. The model of computation is a random access machine with
the standard instruction set (direct and indirect addressing, conditional
branching, addition, subtraction, and multiplication). We show that if s
memory registers are used to store S, where n <= s <= m/n^epsilon, then query
time  Omega(log n) is necessary in the worst case. That is, under these conditions,
the solution consisting of storing S as a sorted table and doing
binary search is optimal. The condition s <= m/n^epsilon is essentially optimal;
we show that if n + m/n^o(1) registers may be used, query time o(log n) is
possible.

Downloads

Publiceret

1995-01-26

Citation/Eksport

Fich, F., & Miltersen, P. B. (1995). Tables should be sorted (on random access machines). BRICS Report Series, 2(26). https://doi.org/10.7146/brics.v2i26.19928

Nummer

Nr. 26 (1995): RS-26 Tables should be sorted (on random access machines)

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