Nonoblivious hashing

Authors:
Amos Fiat;Moni Naor;Jeanette P. Schmidt;Alan Siegel
Affiliations:
-;-;-;-
Venue:
Journal of the ACM (JACM)
Year:
1992

Citing 16
Cited 9

Partial match retrieval in implicit data structures

Information Processing Letters
Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)
Two results on tables

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

Journal of Computer and System Sciences
Collections of functions for perfect hashing

SIAM Journal on Computing
A tradeoff between search and update time for the implicit dictionary problem

International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Searching a two key table under a single key

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Storing and searching a multikey table

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Implicit O(1) probe search

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The spatial complexity of oblivious k-probe Hash functions

SIAM Journal on Computing
Optimal Arrangement of Keys in a Hash Table

Journal of the ACM (JACM)
Expected Length of the Longest Probe Sequence in Hash Code Searching

Journal of the ACM (JACM)
Should Tables Be Sorted?

Journal of the ACM (JACM)
Storing a sparse table

Communications of the ACM
An Improved Program for Constructing Open Hash Tables

Proceedings of the 7th Colloquium on Automata, Languages and Programming
The program complexity of searching a table (data structures, applied combinatorics)

The program complexity of searching a table (data structures, applied combinatorics)

Are bitvectors optimal?

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Storing information with extractors

Information Processing Letters
Hashing Methods for Temporal Data

IEEE Transactions on Knowledge and Data Engineering
Static Dictionaries Supporting Rank

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Representing Trees of Higer Degree

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
No sorting? better searching!

ACM Transactions on Algorithms (TALG)
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimal cache-oblivious implicit dictionaries

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The complexity of implicit and space efficient priority queues

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nonoblivious hashing, where information gathered from unsuccessful probes is used to modify subsequent probe strategy, is introduced and used to obtain the following results for static lookup on full tables:(1) An O(1)-time worst-case scheme that uses only logarithmic additional memory, (and no memory when the domain size is linear in the table size), which improves upon previously linear space requirements.(2) An almost sure O(1)-time probabilistic worst-case scheme, which uses no additional memory and which improves upon previously logarithmic time requirements.(3) Enhancements to hashing: (1) and (2) are solved for multikey recors, where search can be performed under any key in time O(1); these schemes also permit properties, such as nearest neighbor and rank, to be determined in logarithmic time.