| 
|
QuoteRef: zobeJ11_2005
Topic:
hash table and hash functions
Topic:
memory cache
Group:
data structures
Topic:
recursive data structures
Topic:
strings
Reference
Zobel, J., Askitis, N., "Cache-conscious collision resolution in string hash tables", in Consens, M., Navarro, G. (ed.), String Processing and Information Retrieval. 12th International Conference, SPIRE 2005, Buenos Aires, Argentina, November 2005, Springer, LNCS 3772, pp. 91-102. Google
92 ;;Quote: compact chaining stores strings in the hash node; faster and less space
92 ;;Quote: use a contiguous array for all strings in a hash chain; good spatial locality; reduces overhead for skew distributions to 2 bits per string
92 ;;Quote: use contiguous, pointer-free storage for in-memory data structures; random access is expensive, like disks
95 ;;Quote: use 7- or 15-bit lengths for hashed strings; string match fails on first character
98 ;;Quote: for words, exact-fit array hashing most efficient with load average of 20; for URLs, best load average was less than 1
Topic: hash table and hash functions (41 items)
Topic: memory cache (29 items)
Group: data structures (12 topics, 278 quotes)
Topic: recursive data structures (18 items)
Topic: strings (13 items)