I went through that document. It mentions about the Lucene's Indexing algorithm that it uses incremental algorithm. So, can i say that it uses a combination of segment-based and b-tree based strategies. If i am wrong please correct me.
On 1/26/07, Damien McCarthy <[EMAIL PROTECTED]> wrote:
This document should contain the information you need : http://lucene.sourceforge.net/talks/inktomi/ Damien. -----Original Message----- From: Sairaj Sunil [mailto:[EMAIL PROTECTED] Sent: 26 January 2007 03:22 To: java-user@lucene.apache.org Subject: Re: Lucene Indexing Hi I was asking what exactly is the inverted indexing strategy used for storing the index. Is it batch-based index/b-tree based/segment-based data structure that is used as an index data structure. On 1/25/07, Rajiv Roopan <[EMAIL PROTECTED]> wrote: > > > http://lucene.apache.org/java/docs/api/org/apache/lucene/search/Similarity.h tml > > > On 1/24/07, Sairaj Sunil <[EMAIL PROTECTED]> wrote: > > > > Hi all, > > Can you tell me the exact indexing algorithm used by Lucene. or give > some > > links to the documents that describe the algorithm used by lucene > > Thanks in advance > > -- > > Sairaj Sunil > > > > > > -- Sairaj Sunil --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
-- Sairaj Sunil II Mtech(CS) SSSIHL Prashanthi Nilayam
