2157 search results - page 9 / 432 » Optimal Fast Hashing |
115
click to vote
DCC
2007
IEEE
16 years 1 months ago
2007
IEEE
A linear (qd, q, t)-perfect hash family of size s in a vector space V of order qd over a field F of order q consists of a set S = {1, . . . , s} of linear functionals from V to F ...
110
click to vote
GLOBECOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
COMPSAC
1996
IEEE
15 years 6 months ago
1996
IEEE
In this paper, we are concerned with the problem of designing optimal linear hashing files for orthogonal range retrieval. Through the study of performance expressions, we show th...
105
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—Hash tables are extensively used in networking to implement data-structures that associate a set of keys to a set of values, as they provide O(1), query, insert and delete opera...
112
click to vote
SOFSEM
2009
Springer
15 years 10 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...