On Mar 28, 2006, at 11:57 PM, Prasenjit Mukherjee wrote:
It seems to me that lucene doesn't use B-tree for its indexing
storage. Any paper/article which explains the theory behind data-
structure of single index(segment). I am not referring to the
merge algorithm, I am curious to know the storage structure of a
single optimized lucene index.
Any pointer is greatly appreciated.
How about this for starters?
http://lucene.apache.org/java/docs/fileformats.html
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
