Hello

I read some document about lucene ; also i read the document in this link ( http://lucene.sourceforge.net/talks/pisa ) .

I don't really understand how lucene index documents and don't understand lucene work with which algorithm for indexing ?

On above link , said lucene use this algorithm for indexing :

* incremental algorithm:
      o maintain a stack of segment indices
      o create index for each incoming document
      o push new indexes onto the stack
      o let b=10 be the merge factor; M=8

        for (size = 1; size < M; size *= b) {
          if (there are b indexes with size docs on top of the stack) {
           pop them off the stack;
           merge them into a single index;
           push the merged index onto the stack;
         } else {
           break;
         }
        }

How this algorithm help us to have an optimize indexing ? Does lucene use B-tree algorithm or any other algorithm like that for indexing or have a paticular algorithm ?

Thank you for reading my post .