On 8/1/06, Pedro Côrte-Real <[EMAIL PROTECTED]> wrote: > On Tue, 2006-08-01 at 18:59 +0900, David Balmain wrote: > > Hmmm. Sounds like an interesting application. One solution would be to > > cache the sort index on disk. The problem with this is that the cache > > would still need to be recalculated every time you add more documents > > to the index so you'll still have the long wait occasionally. I'll > > look into it anyway at a later stage. > > For my application this wouldn't really be a problem since data is only > loaded maybe once a week. But does the cache need to be recalculated > completely? Database indexes work incrementally.
Sure it's possible but it's a fair bit of work. Lucene doesn't have anything like this yet (not that that has stopped me adding features before). I'll think about it. Dave _______________________________________________ Ferret-talk mailing list [email protected] http://rubyforge.org/mailman/listinfo/ferret-talk
