On Jan 16, 2007, at 2:30 PM, robert engels wrote:
What is the problem with implementing the KinoSearch model for
Lucene? It seems this would solve nearly all of these issues in a
very srtaightfoward way.
It's a major undertaking, and the only developer sufficiently
motivated thus far has been me. I have only so much time to dedicate
to working on Java Lucene.
I also don't see how you do this without bytecount-based strings.
My general plan has been to force KS 0.20_01 out the door, then
present it as a model. But Michael McCandless has been accelerating
the discussions around here and so it seemed better to get a word in
while the window was open. :)
It would seem that a very simple SortPool implementation that did
everything in memory would be ideal for Lucene server based
environments.
The external sorter keeps track of its memory consumption, and only
flushes to disk when a user-settable threshold is exceeded. You can
set the threshold high if you like.
Marvin Humphrey
Rectangular Research
http://www.rectangular.com/
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
