Storing and searching a multikey table

Amos Fiat, Moni Naor, Alejandro A. Scliäfer, Jeanette P. Schmidt, Alan Siegel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We describe an implicit data structure for n multikey records that supports searching for a record, under any key, in the asymptotically optimal search time O(log n). This improves on [Mun87] in which Munro describes an implicit data structure for the problem of storing n k-key records so that search on any key can be performed in O(logk n(log log n)k-1) comparisons. The theoretical tools we develop also yield practical schemes that either halve the number of memory references over obvious solutions to the non-implicit version of the problem, or alternatively reduce the number of pointers involved significantly.

Original languageEnglish (US)
Title of host publicationProceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988
PublisherAssociation for Computing Machinery
Pages344-353
Number of pages10
ISBN (Print)0897912640, 9780897912648
DOIs
StatePublished - 1988
Event20th Annual ACM Symposium on Theory of Computing, STOC 1988 - Chicago, IL, United States
Duration: May 2 1988May 4 1988

Other

Other20th Annual ACM Symposium on Theory of Computing, STOC 1988
CountryUnited States
CityChicago, IL
Period5/2/885/4/88

Fingerprint

Data structures
Data storage equipment

ASJC Scopus subject areas

  • Software

Cite this

Fiat, A., Naor, M., Scliäfer, A. A., Schmidt, J. P., & Siegel, A. (1988). Storing and searching a multikey table. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988 (pp. 344-353). Association for Computing Machinery. https://doi.org/10.1145/62212.62245

Storing and searching a multikey table. / Fiat, Amos; Naor, Moni; Scliäfer, Alejandro A.; Schmidt, Jeanette P.; Siegel, Alan.

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988. Association for Computing Machinery, 1988. p. 344-353.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fiat, A, Naor, M, Scliäfer, AA, Schmidt, JP & Siegel, A 1988, Storing and searching a multikey table. in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988. Association for Computing Machinery, pp. 344-353, 20th Annual ACM Symposium on Theory of Computing, STOC 1988, Chicago, IL, United States, 5/2/88. https://doi.org/10.1145/62212.62245
Fiat A, Naor M, Scliäfer AA, Schmidt JP, Siegel A. Storing and searching a multikey table. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988. Association for Computing Machinery. 1988. p. 344-353 https://doi.org/10.1145/62212.62245
Fiat, Amos ; Naor, Moni ; Scliäfer, Alejandro A. ; Schmidt, Jeanette P. ; Siegel, Alan. / Storing and searching a multikey table. Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988. Association for Computing Machinery, 1988. pp. 344-353
@inproceedings{6e6df5957a344eef995cdd2b86d30624,
title = "Storing and searching a multikey table",
abstract = "We describe an implicit data structure for n multikey records that supports searching for a record, under any key, in the asymptotically optimal search time O(log n). This improves on [Mun87] in which Munro describes an implicit data structure for the problem of storing n k-key records so that search on any key can be performed in O(logk n(log log n)k-1) comparisons. The theoretical tools we develop also yield practical schemes that either halve the number of memory references over obvious solutions to the non-implicit version of the problem, or alternatively reduce the number of pointers involved significantly.",
author = "Amos Fiat and Moni Naor and Scli{\"a}fer, {Alejandro A.} and Schmidt, {Jeanette P.} and Alan Siegel",
year = "1988",
doi = "10.1145/62212.62245",
language = "English (US)",
isbn = "0897912640",
pages = "344--353",
booktitle = "Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Storing and searching a multikey table

AU - Fiat, Amos

AU - Naor, Moni

AU - Scliäfer, Alejandro A.

AU - Schmidt, Jeanette P.

AU - Siegel, Alan

PY - 1988

Y1 - 1988

N2 - We describe an implicit data structure for n multikey records that supports searching for a record, under any key, in the asymptotically optimal search time O(log n). This improves on [Mun87] in which Munro describes an implicit data structure for the problem of storing n k-key records so that search on any key can be performed in O(logk n(log log n)k-1) comparisons. The theoretical tools we develop also yield practical schemes that either halve the number of memory references over obvious solutions to the non-implicit version of the problem, or alternatively reduce the number of pointers involved significantly.

AB - We describe an implicit data structure for n multikey records that supports searching for a record, under any key, in the asymptotically optimal search time O(log n). This improves on [Mun87] in which Munro describes an implicit data structure for the problem of storing n k-key records so that search on any key can be performed in O(logk n(log log n)k-1) comparisons. The theoretical tools we develop also yield practical schemes that either halve the number of memory references over obvious solutions to the non-implicit version of the problem, or alternatively reduce the number of pointers involved significantly.

UR - http://www.scopus.com/inward/record.url?scp=84899031459&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84899031459&partnerID=8YFLogxK

U2 - 10.1145/62212.62245

DO - 10.1145/62212.62245

M3 - Conference contribution

AN - SCOPUS:84899031459

SN - 0897912640

SN - 9780897912648

SP - 344

EP - 353

BT - Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988

PB - Association for Computing Machinery

ER -