标 题: Re: 再问个N久前的面试题
发信站: 水木社区 (Thu Dec 6 20:16:08 2007), 站内
In fact, in information retrieval area, they usually employ the "double array trie structure" to store the trie structure.
Double array trie structure is a VERY compact datastrcture(I think it can store 100,000 words in several megabytes), and moves as fast as the 256-trie implementation(or even faster because of low memory usage and better cache locality).
【 在 chainone (what's up) 的大作中提到: 】
: 做一本英文字典。怎样设计数据结构？TIER树？
: 如果内存很有限，那棵树/表放不下呢？
: 特别提了如果HASH TABLE大到内存里面放不下，应该如何呢？