I question whether you *can* make this decision based upon the data
structure being used. I can code such that *any* data structure you care
to name will not perform well under some conditions .
Not to mention the other characteristics of a search engine that get in
the way of even the very most e
Well, I have seen this link many times before. It doesn't really explain
the data structures part of it. Perhaps I should have asked my question
this way:
"What data structures are being used by Lucene to read the posting lists
from the index ?" .
My guess is that a hash table is being used for
http://lucene.apache.org/java/2_4_0/fileformats.html
On Dec 15, 2008, at 12:15 AM, Prafulla Kiran wrote:
Hi Everybody,
Could someone please explain the actual data structures being used
by Lucene for storing the postings list in the index. I see a file
called MultileveSkipListReader and Mu
