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 t
The problem isn't sorting per-se... the problem is quickly retrieving
the sort value for a document. For that, we currently have the
FieldCache that's what takes up the memory. There are more memory
efficient ways, but they just haven't been implemented yet.
-Yonik
On Tue, Jul 29, 2008 at 3:
