Author:
Fiat Amos,Naor Moni,Schmidt Jeanette P.,Siegel Alan
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Nearly Optimal Static Las Vegas Succinct Dictionary;SIAM Journal on Computing;2022-05-02
2. Nearly optimal static Las Vegas succinct dictionary;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06
3. Approximate Dictionaries;Encyclopedia of Algorithms;2016
4. Approximate Dictionaries;Encyclopedia of Algorithms;2015
5. Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error;Theory of Computing Systems;2012-09-12