An implicit data structure for searching a multikey table in logarithmic time

Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel

Research output: Contribution to journalArticle

Abstract

A data structure is implicit if it uses no extra strorage beyond the space needed for the data and a constant number of parameters. We describe an implicit data structure for storing nk-key records, which supports searching for a record, under any key, in the asymptotically optimal search time O(1g n). This is in sharp contrast to an Ω(n1- 1 k) lower bound which holds if all comparisons must be against the sought key value. The theoretical tools we develop also yield a more practical way to halve the number of memory references used in obvious non-implicit solutions to the multikey table problem.

Original languageEnglish (US)
Pages (from-to)406-424
Number of pages19
JournalJournal of Computer and System Sciences
Volume43
Issue number3
DOIs
StatePublished - 1991

Fingerprint

Data structures
Table
Data Structures
Logarithmic
Halve
Asymptotically Optimal
Data storage equipment
Lower bound

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

An implicit data structure for searching a multikey table in logarithmic time. / Fiat, Amos; Ian Munro, J.; Naor, Moni; Schäffer, Alejandro A.; Schmidt, Jeanette P.; Siegel, Alan.

In: Journal of Computer and System Sciences, Vol. 43, No. 3, 1991, p. 406-424.

Research output: Contribution to journalArticle

Fiat, Amos ; Ian Munro, J. ; Naor, Moni ; Schäffer, Alejandro A. ; Schmidt, Jeanette P. ; Siegel, Alan. / An implicit data structure for searching a multikey table in logarithmic time. In: Journal of Computer and System Sciences. 1991 ; Vol. 43, No. 3. pp. 406-424.
@article{7a5d9fcd866f4487a3a6439dfe1b9c0f,
title = "An implicit data structure for searching a multikey table in logarithmic time",
abstract = "A data structure is implicit if it uses no extra strorage beyond the space needed for the data and a constant number of parameters. We describe an implicit data structure for storing nk-key records, which supports searching for a record, under any key, in the asymptotically optimal search time O(1g n). This is in sharp contrast to an Ω(n1- 1 k) lower bound which holds if all comparisons must be against the sought key value. The theoretical tools we develop also yield a more practical way to halve the number of memory references used in obvious non-implicit solutions to the multikey table problem.",
author = "Amos Fiat and {Ian Munro}, J. and Moni Naor and Sch{\"a}ffer, {Alejandro A.} and Schmidt, {Jeanette P.} and Alan Siegel",
year = "1991",
doi = "10.1016/0022-0000(91)90022-W",
language = "English (US)",
volume = "43",
pages = "406--424",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - An implicit data structure for searching a multikey table in logarithmic time

AU - Fiat, Amos

AU - Ian Munro, J.

AU - Naor, Moni

AU - Schäffer, Alejandro A.

AU - Schmidt, Jeanette P.

AU - Siegel, Alan

PY - 1991

Y1 - 1991

N2 - A data structure is implicit if it uses no extra strorage beyond the space needed for the data and a constant number of parameters. We describe an implicit data structure for storing nk-key records, which supports searching for a record, under any key, in the asymptotically optimal search time O(1g n). This is in sharp contrast to an Ω(n1- 1 k) lower bound which holds if all comparisons must be against the sought key value. The theoretical tools we develop also yield a more practical way to halve the number of memory references used in obvious non-implicit solutions to the multikey table problem.

AB - A data structure is implicit if it uses no extra strorage beyond the space needed for the data and a constant number of parameters. We describe an implicit data structure for storing nk-key records, which supports searching for a record, under any key, in the asymptotically optimal search time O(1g n). This is in sharp contrast to an Ω(n1- 1 k) lower bound which holds if all comparisons must be against the sought key value. The theoretical tools we develop also yield a more practical way to halve the number of memory references used in obvious non-implicit solutions to the multikey table problem.

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

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

U2 - 10.1016/0022-0000(91)90022-W

DO - 10.1016/0022-0000(91)90022-W

M3 - Article

VL - 43

SP - 406

EP - 424

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 3

ER -