Guys.
I've noticed many having trouble with sorting and OOM. Eventually they solve
it by throwing more memory at the problem.
Should'nt a solution which can sort on disk when neccessary be implemented
in core Lucene ?
Something like this:
I think you'll find it slow to add disk seeks in the sort on each
search. Something you might be able to work from though (though I doubt
it still applys cleanly) is Hoss' issue
https://issues.apache.org/jira/browse/LUCENE-831. This allows for a
pluggable cache implementation for sorting. Also
Yep a disk sort is slow as hell compared to mem sort. What I was thinking
was something like a db thinks.
MySQL for example does exactly this. If the resultset do not fit properly in
mem spool it on disk and sort it.
The thing is that it would allow you to continue adding docs to the index
even
