| 
|
QuoteRef: heinS4_2002
ThesaHelp:
ACM references f-l
Topic:
suffix trie
Topic:
adaptive hash table
Topic:
full-text indexing
Topic:
statistics
Topic:
biology
Reference
Heinz, S., Zobel, J., Williams, H.E., "Burst tries: a fast, efficient data structure for string keys", ACM Transactions on Information Systems, 20, 2, April 2002, pp. 192-223. Google
193 ;;Quote: use burst trie for sorted data; containers (e.g., binary tree) accessed by a trie; better performance than binary tree, splay tree, ternary tree; only 25% slower than hash table
195 ;;Quote: vocabulary accumulation by move-to-front hash chains; 99% of searches at first node in chain
203 ;;Quote: trend heuristic for bursting by using one counter per container; start value with bonuses and penalties; burst container when 0
205 ;;Quote: genomic nucleotide data has a fairly uniform distribution of 9-grams; poor locality
ThesaHelp: ACM references f-l (241 items)
Topic: suffix trie (18 items)
Topic: adaptive hash table (19 items)
Topic: full-text indexing (35 items)
Topic: statistics (12 items)
Topic: biology (24 items)