4438 search results - page 9 / 888 » On the Distribution of Keys by Hashing |
TOIS
2002
14 years 11 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
ICDE
2005
IEEE
15 years 5 months ago
2005
IEEE
Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applic...
70
Voted
ACISP
2005
Springer
15 years 5 months ago
2005
Springer
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this work we have compared two indexing algorithms that have been used to index and retrieve Carnatic music songs. We have compared a modified algorithm of the Dual ternary ind...
130
click to vote
CRYPTO
1995
Springer
15 years 3 months ago
1995
Springer
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small numb...