Searching a two key table under a single key

Authors:
J. I. Munro
Affiliations:
Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Venue:
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Year:
1987

Citing 5
Cited 4

Partial match retrieval in implicit data structures

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

Journal of Computer and System Sciences
A tradeoff between search and update time for the implicit dictionary problem

International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Implicit Data Structures for the Dictionary Problem

Journal of the ACM (JACM)
Multidimensional binary search trees used for associative searching

Communications of the ACM

Storing and searching a multikey table

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)
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a method for arranging an arbitrary 2-key table as an n by 2 array such that a search can be performed under either key in O(lg2n lglg n) time. This is in sharp contrast with an &OHgr;(√n) lower bound for the problem under a model in which all comparisons must involve the value being searched for.