Th QuoteRef: zobeJ12

QuoteRef: zobeJ12_2001

topics > all references > ThesaHelp: references t-z

Topic:
full-text indexing
Topic:
hash table and hash functions
Topic:
adaptive hash table

Reference

Zobel, J., Heinz, S., Williams, H.E., "In-memory hash tables for accumulating text vocabularies", Information Processing Letters, 80, 6, December 2001, pp. 271-277. Google

Quotations

271 ;;Quote: chained hash tables are best for building vocabularies; considerably faster than splay trees and binary trees

271 ;;Quote: move-to-front works well for hash tables; better than extendible hashing; effective for vocabulary accumulation at 80 strings per slot

Related Topics

Topic: full-text indexing (37 items)
Topic: hash table and hash functions (41 items)
Topic: adaptive hash table (19 items)