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.
So wantted to know if Lucene implements it that way ( if not in the data
storage of the index in the file, atleast in the memory during lookups??)
Shailesh
---------------------------------
Yahoo! Photos
Ring in the New Year with Photo Calendars. Add photos, events, holidays,
whatever.
