I think Doug's paper ( specifically the Seek and Transfer section ) is
the closest I could get. A little bit detailed explanation can be found
in Yates' book on Information-Retreival. I agree with Dimitry, a
detailed explanation (or even pointers to some existing arcticle would
be beneficial t
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 Luce
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
I have already gone through the fileformat. What I was looking for, is
the underlying theory behind the chosen fileformats. I am sure those
fileformats were decided based on some theoritical axioms.
--prasen
[EMAIL PROTECTED] wrote:
On Mar 28, 2006, at 11:57 PM, Prasenjit Mukherjee wrote:
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
