Thanks Erick for you insight.
I'd appreciate if someone could throw more light on it.
Thanks
On Tue, Nov 9, 2010 at 11:27 PM, Erick Erickson wrote:
> I'm going to have to leave answering that to people with more
> familiarity with the underlying code than I have...
>
> That said, I'd #guess# th
I'm going to have to leave answering that to people with more
familiarity with the underlying code than I have...
That said, I'd #guess# that you'll be OK because I'd #guess# that
filters are maintained on a per-reader basis and the results
are synthesized when combined in a MultiSearcher.
But th
Thanks Erick, you cleared some of my confusions. But I still have a doubt.
As you can see in previous example code I am re-creating parallel multi
searcher for each search. (This is the actual scenario on production
servers)
The ParallelMultiSearcher constructor is taking different combination of
Ignore my previous, I thought you were constructing your own filters. What
you're doing should
be OK.
Here's the source of my confusion. Each of your indexes has Lucene document
IDs starting at
0. In your example, you have two docs/index. So, if you created a Filter via
lower-level
calls, it coul
Hi Erick, Thanks for the reply.
Your answer have puzzled me more because what I am able to view is not what
you say or I am not able to grasp your meaning.
I have written a small program which is exactly what my original question
was. Here I am creating a CachingWrapperFilter on one index and reu
I'm assuming you're down in Lucene land. Unless somehow you've
gotten 63 separate filters when you think you only have one, I don't
think what you're doing will work. Or I'm failing to understand what
you're doing at all.
The problem is I expect each of your indexes starts with document
1. So your
Hi. We have a large index (~ 28 GB) which is distributed in three different
directories, each representing a country. Each of these country wise indexes
is further distributed on the basis of last update date into 21 smaller
indexes. This index is updated once in a day.
A user can search into any