Ideally, I'd love to see an article explaining both in detail: the index structure as well as the merge algorithm...
________________________________ From: Prasenjit Mukherjee [mailto:[EMAIL PROTECTED] Sent: Tue 3/28/2006 11:57 PM To: java-user@lucene.apache.org Subject: Data structure of a Lucene Index 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. --Prasen --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
--------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
