5 search results - page 1 / 1 » Cache-Conscious Collision Resolution in String Hash Tables |
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...
ACSC
2007
IEEE
13 years 11 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
CORR
2010
Springer
13 years 5 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...
GLOBECOM
2008
IEEE
13 years 6 months ago
2008
IEEE
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...