Mike,
Thank you for your help. Below are a few comments to directly reply to
your questions, but in general your suggestions helped to get me on the
right track and I believe that have been able to solve the Lucene component
of my problems. The short answer was that I when I had previously tri
Hi
I know how to get the docFreq of a term in a single field (say "content" field)
int docFreqInIndex = indexReader.docFreq(new Term("content", q));
But is it possible to get the docFreq of a boolean query consisting of matches
across two or more fields? For instance,
BooleanQuery booleanQuer
Hi,
thank you for your explanation!
I used a wrapped BooleanQuery instead, this turned out to be a lot faster.
Christoph
Am 16.12.2013 15:19, schrieb Uwe Schindler:
Hi,
The problem with BooleanFilter is its implementation:
It creates BitSets and AND/ORs them together. The BitSets are created,
Hi,
The problem with BooleanFilter is its implementation:
It creates BitSets and AND/ORs them together. The BitSets are created, because
you can cache them for later use (the main use-case for filters).
In contrast, a query intersect the DocIdSetIterators directly. The good thing
with this: If y
Hi all,
from my tests on an index with 22 million entries, it seems that in many
cases a BooleanFilter is a lot slower than an equivalent BooleanQuery.
Is this the expected behaviour? i would have expected a Filter to be at
least as fast as a query, since it basically does the same thing, but
I am trying to model a transaction-log for lucene, which creates a
transaction-log per-commit
Things work fine during normal operations, but I cannot fathom the effect
during
a. IOException during Index-Commit
Will the index be restored to previous commit-point? Can I blindly re-try
operations f
