Storing and searching a multikey table

Authors:
Amos Fiat;Moni Naor;Alexandro Schäffer;Jeanette Schmidt;Alan Siegel
Affiliations:
Computer Science Division, University of California at Berkeley, Berkeley, CA;Computer Science Division, University of California at Berkeley, Berkeley, CA;Computer Science Department, Stanford University, Stanford, California;Computer Science Department, Courant Institute, New York University, New York, NY;Computer Science Department, Courant Institute, New York University, New York, NY
Venue:
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Year:
1988

Citing 3
Cited 2

An implicit data structure supporting insertion, deletion, and search in O(log:OS2:OEn) time

Journal of Computer and System Sciences
Searching a two key table under a single key

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Non-oblivious hashing

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

Non-oblivious hashing

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Nonoblivious hashing

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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 &Ogr;(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 &Ogr;(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.