: Suppose user makes a search for "X" and he get 200 hits from s[0], 150 hits
: from s[1] and 300 hits from s[2]. Now we need to cluster/group the results
: according to each searcher.
it sounds like you don't really want a multisearcher .. it sounds like you
just want to search each of the indiv
Hi Doron,
Yes, we can do it using MultiSearcher.subSearcher(int n). But here we can
not get cluster for individual searcher. For this we have to apply a loop
from (i = 0 to 3000), which we do not want in our case.
We need to show number of hits from each searcher (Without using loop on
hits).
S
Hi Sawan,
If I understand the question correctly, you use MultiSearcher over three
searchers s[0], s[1], s[2], get some 3000 search results, and for result x
(0<=x<3000) need to know if it came from s[0], s[1], or s[2]. If so, take
a look at that MultiSearcher.subSearcher(int n) (n would be the
Hi all,
I am using MultiSearcher to search more then one Index folders. I have one
Index searcher array which contains 3 Index searchers...
01. C:\IndexFolder1
02. C:\IndexFolder2
03. C:\IndexFolder3
When I searched in 3 index folders using a MultiSearcher then I got 3000
hits.
1 to 1000 from C
