lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Doug Cutting <cutt...@apache.org>
Subject Re: Data structure of a Lucene Index
Date Thu, 30 Mar 2006 22:46:08 GMT
I talked about this a bit in a presentation at Haifa last year:

http://www.haifa.ibm.com/Workshops/ir2005/papers/DougCutting-Haifa05.pdf

See the section on "Seek versus Transfer".

Doug

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.
> --Prasen
> 
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
> For additional commands, e-mail: java-user-help@lucene.apache.org
> 

---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
For additional commands, e-mail: java-user-help@lucene.apache.org


Mime
View raw message