Results 1  10
of
790
Cuckoo hashing
 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 196 (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
HistoryIndependent Cuckoo Hashing
"... 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 16 (4 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
"... Cuckoo Hashing is a technique for resolving collisions in hash tables that produces a dictionary with constanttime worstcase lookup and deletion operations as well as amortized constanttime 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 dictionary with constanttime worstcase lookup and deletion operations as well as amortized constanttime insertion operations. First introduced by Pagh in 2001 [3] as an extension of a previous static
Cuckoo hashing: Further analysis
, 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#>0andn is the number of data points. Slightly improved bounds are obtained f ..."
Abstract

Cited by 28 (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#>0andn is the number of data points. Slightly improved bounds are obtained
A Lecture on Cuckoo Hashing
, 2002
"... has been intensive research into finding perfect hash functions. The idea is to start with a pseudorandom 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
and Blocked Cuckoo Hashing
, 2005
"... We study a particular aspect of the balanced allocation paradigm (also known as the “twochoices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be fixed, and assume there are m bins of capacity d each. To each of n ≤ dm balls two possible bins are assigned at random. How cl ..."
Abstract
 Add to MetaCart
present in order to accommodate the new ball. We show that on average it takes constant time to rearrange the balls to achieve this, for ε> γ · β d, for some constants γ> 0, β < 1. An alternative way to describe the problem is in data structure language. Generalizing cuckoo hashing (Pagh
Notes about dcuckoo hashing
, 2006
"... We show an upper bound for the minimal size set of keys which cannot be inserted into a dcuckoo 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 dcuckoo 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
A precise analysis of cuckoo hashing
, 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 6 (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
An Analysis of RandomWalk Cuckoo Hashing
"... In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the randomwalk insertion method. Cuckoo hashing provides a useful methodology for building practical, highperformance 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 randomwalk insertion method. Cuckoo hashing provides a useful methodology for building practical, highperformance hash tables. The essential idea of cuckoo hashing
/ pagh/papers/ Cuckoo Hashing
"... Abstract. We present a simple and ecient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. The space usage is similar to that of binary search trees, i.e., three words per key on average. The ..."
Abstract
 Add to MetaCart
Abstract. We present a simple and ecient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. The space usage is similar to that of binary search trees, i.e., three words per key on average
Results 1  10
of
790