On Donnerstag 12 Januar 2006 05:47, shailesh kumar wrote: > I had looked at the document you had listed as well as used a Hex > editor to look at the segment files. .That is how I came to know about > the lexicographic sorting. But was not sure if BTree is used. If I > understand correctly a Binary tree (i.e each node only 2 children) or > a high order Balanced tree (where in a range of values are stored in > the node and each node can have more than 2 children) is the best way > to search.
The list of terms is a list on disk. Every n-th (128th I think) entry is kept in memory as an index to the list on disk. Both lists are sorted to allow binary searching. Regards Daniel -- http://www.danielnaber.de --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
