Hi Robert,
Maybe I didn't explain it clearly but we're not going to constantly switch
between writers or share effort between writers, it's purely for
availability: the second writer only kicks in when the first writer is not
available for some reason.
And as far as I know the replicator/nrt
This multiple-writer isn't going to work and customizing names won't
allow it anyway. Each file also contains a unique identifier tied to
its commit so that we know everything is intact.
I would look at the segment replication in lucene/replicator and not
try to play games with files and mixing
Hi Folks,
We're trying to build a search architecture using segment replication
(indexer and searcher are separated and indexer shipping new segments to
searchers) right now and one of the problems we're facing is: for
availability reason we need to have multiple indexers running, and when the
Hi
I scratched a simple qparser plugin to experiment with intervals in Solr.
https://github.com/mkhludnev/solr-flexible-qparser
I pushed the jar under releases, and described how to use it in README.md.
Sjoerd,
if spans really blows all heap, you can give a try with intervals with this
plugin.
Michael, thanks for stepping in!
> it seems that simple phrase
queries would suffice here in place of spanNear?
I think it wouldn't. It seems to me 4 is slop, and false is inOrder.
Sjoerd, can you comment about particualt span queries you uses?
Also, do you have any heap dump summary to
I don't think that nested boolean disjunctions consisting of isolated
spanNear queries at the leaves should have memory issues (as opposed
to nested spanNear queries around disjunctions, which might well do).
Am I misreading the string representation of that query? A little bit
more explicit
