Results 1 - 10 of 82

Cuckoo hashing

by Rasmus Pagh, Flemming Friche Rodler - JOURNAL OF ALGORITHMS , 2001
"... We present a simple dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738–761, 1994). The space usage is similar to that ..."
Abstract - Cited by 202 (7 self) - Add to MetaCart
We present a simple dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738–761, 1994). The space usage is similar

History-Independent Cuckoo Hashing

by Moni Naor, Gil Segev, Udi Wieder
"... Cuckoo hashing is an efficient and practical dynamic dictionary. It provides expected amortized constant update time, worst case constant lookup time, and good memory utilization. Various experiments demonstrated that cuckoo hashing is highly suitable for modern computer architectures and distribute ..."
Abstract - Cited by 14 (2 self) - Add to MetaCart
Cuckoo hashing is an efficient and practical dynamic dictionary. It provides expected amortized constant update time, worst case constant lookup time, and good memory utilization. Various experiments demonstrated that cuckoo hashing is highly suitable for modern computer architectures

An Overview of Cuckoo Hashing

by Charles Chen
"... Cuckoo Hashing is a technique for resolving collisions in hash tables that produces a dic-tionary with constant-time worst-case lookup and deletion operations as well as amortized constant-time insertion operations. First introduced by Pagh in 2001 [3] as an extension of a previous static dictionary ..."
Abstract - Add to MetaCart
Cuckoo Hashing is a technique for resolving collisions in hash tables that produces a dic-tionary with constant-time worst-case lookup and deletion operations as well as amortized constant-time insertion operations. First introduced by Pagh in 2001 [3] as an extension of a previous static

Cuckoo hashing with pages

by Martin Dietzfelbinger, Michael Mitzenmacher, Michael Rink, Fakultät Für Informatik Und Automatisierung - In Algorithms–ESA 2011 , 2011
"... Abstract. Although cuckoo hashing has significant applications in both theoretical and practical settings, a relevant downside is that it requires lookups to multiple locations. In many settings, where lookups are ex-pensive, cuckoo hashing becomes a less compelling alternative. One such standard se ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. Although cuckoo hashing has significant applications in both theoretical and practical settings, a relevant downside is that it requires lookups to multiple locations. In many settings, where lookups are ex-pensive, cuckoo hashing becomes a less compelling alternative. One such standard

Cuckoo hashing: Further analysis

by Luc Devroye, Pat Morin , 2003
"... We consider cuckoo hashing as proposed by Pagh and Rodler in 2001. We show that the expected construction time of the hash table is O(n) as long as the two open addressing tables are each of size at least (1 #)n,where#>0 and n is the number of data points. Slightly improved bounds are obtained ..."
Abstract - Cited by 27 (1 self) - Add to MetaCart
We consider cuckoo hashing as proposed by Pagh and Rodler in 2001. We show that the expected construction time of the hash table is O(n) as long as the two open addressing tables are each of size at least (1 #)n,where#>0 and n is the number of data points. Slightly improved bounds

Lock-free cuckoo hashing,”

by Nhan Nguyen , Philippas Tsigas , 2014
"... Abstract-This paper presents a lock-free cuckoo hashing algorithm; to the best of our knowledge this is the first lockfree cuckoo hashing in the literature. The algorithm allows mutating operations to operate concurrently with query ones and requires only single word compare-and-swap primitives. Qu ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract-This paper presents a lock-free cuckoo hashing algorithm; to the best of our knowledge this is the first lockfree cuckoo hashing in the literature. The algorithm allows mutating operations to operate concurrently with query ones and requires only single word compare-and-swap primitives

A Lecture on Cuckoo Hashing

by Peter Sanders , 2002
"... has been intensive research into finding perfect hash functions. The idea is to start with a pseudo-random hash function and than to patch it based on the particular set of elements stored so that it becomes perfect. Unfortunately this is somewhat complicated in particular if the set of elements sto ..."
Abstract - Add to MetaCart
=ff for some constant ff ! 1. We only require that x is stored either in t 1 [h 1 (x)] or in t 2 [h 2 (x)]. Searching in worst case 1 3,12,... 4,13,... 9,18,... 1,6,10,15... 2,5,11,14,... 7,16,... 8,17,... Figure 1: Example where cuckoo hashing runs into an infinite loop. constant time is easy then

An Analysis of Random-Walk Cuckoo Hashing

by Alan Frieze, Páll Melsted, Michael Mitzenmacher
"... In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing provides a useful methodology for building practical, high-performance hash tables. The essential idea of cuckoo hashing ..."
Abstract - Cited by 9 (3 self) - Add to MetaCart
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing provides a useful methodology for building practical, high-performance hash tables. The essential idea of cuckoo hashing

A precise analysis of cuckoo hashing

by Michael Drmota, Reinhard Kutzelnigg , 2009
"... Cuckoo hashing was introduced by Pagh and Rodler in 2001. Its main feature is that it provides constant worst case search time. The aim of this paper is to present a precise average case analysis of Cuckoo hashing. In particular, we determine the probability that Cuckoo hashing produces no conflicts ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Cuckoo hashing was introduced by Pagh and Rodler in 2001. Its main feature is that it provides constant worst case search time. The aim of this paper is to present a precise average case analysis of Cuckoo hashing. In particular, we determine the probability that Cuckoo hashing produces

Notes about d-cuckoo hashing

by Jurek Czyzowicz, Wojciech Fraczak, Feliks Welfeld , 2006
"... We show an upper bound for the minimal size set of keys which cannot be inserted into a d-cuckoo hashing table independently of the hashing functions and the insertion algorithm. We also discuss the probability for a successful insertion into such a hash table. 1 ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We show an upper bound for the minimal size set of keys which cannot be inserted into a d-cuckoo hashing table independently of the hashing functions and the insertion algorithm. We also discuss the probability for a successful insertion into such a hash table. 1
Results 1 - 10 of 82