Hi chaps,
Just looking for some ideas/experience as to how to improve our
current architecture.
We have a single-index system containing approx. 2.5 million docs of
about 1-3k each.
The Lucene implementation is a daemon and it services requests on
a port in multi-threaded manner, and it runs on
Many thanks to Erik and Ollie for responding - a lot of ideas and I'll have
my work cut out grokking them properly and thinking about what to do.
I'll respond further as that develops.
One quick thing though - Erik wrote:
> So, I wonder if your out of memory issue is really related to the number
Some excellent feedback guys - thanks heaps.
On my OOM issue, I think Hoss has nailed it here:
> That said: if you are seeing OOM errors when you sort by a field (but
> not when you use the docId ordering, or sort by score) then it sounds
> like you are keeping refrences to IndexReaders arround
her with some good logging I can see the searchers being
created up to the max. number, then as I vary the indexing throughput
it drops back and new Searchers are once more created to get searching
back up to date with the index changes.
Cheers,
Paul.
> Paul Waite <[EMAIL PROTECTED]&g
hout the nice
feature of background warming. So the users will have to wear the cost of
that by waiting a bit longer than usual when we are updating the index.
I'm planning to move our system to using Solr, which does have this nice
feature built-in, so I probably won't bother implementing i
I was wondering if there was a nice way to add documents to a cached filter
'manually' as it were.
The reason would be to avoid a complete refresh of the filter, if you
already knew the docids of the extra documents to add.
An example would be if I had a filter based on datetime, which contained
Erick wrote:
> Well, I *suppose* you could get the bitset from the pre-existing filter,
> copy it to the bitset for your new filter, and play with the bits at the
> end. I'm not sure how you get rid of your original filter if you use
> CachingWrapperFilter though.
Ok, I'm hearing it's a d
