Let me leave,3q~
2012/5/8 Li Li
> But this only get (term1 or term2 or term3. ). you can't
> implement (term1 or term2 ...) and (term3 or term4) by this method.
> maybe you should writer your own Scorer to deal with this kind of queries.
>
> On Tue, May 8, 2012 at 9:44 PM, Li Li wrote:
> >
But this only get (term1 or term2 or term3. ). you can't
implement (term1 or term2 ...) and (term3 or term4) by this method.
maybe you should writer your own Scorer to deal with this kind of queries.
On Tue, May 8, 2012 at 9:44 PM, Li Li wrote:
> disjunction query is much slower than conjuct
disjunction query is much slower than conjuction query. That's why
many search engine use conjuction as default.
by the way, you say you have 5,000,000 documents. how many documents
match your query? do you need sort by relevant score or just want to
match and don't care sort?
if you don't care sor
Thanks for you reply,firstly. So many or query is to monitor the
term.One scene is that:if i want to know cities of a province and events that
happens, I may instantiate the query like "(California or NewYork or
SanFransico or SomePlace) and (Pollution or Criminal ... or Alcohol)".
a disjunction (or) query of so many terms is indeed slow.
can u describe your real problem? why you should the disjunction
results of so many terms?
On Sun, May 6, 2012 at 9:57 PM, qibaoy...@126.com wrote:
> Hi,
> I met a problem about how to search many keywords in about 5,000,000
> do
Hi,
I met a problem about how to search many keywords in about 5,000,000
documents.For example the query may be like "(a1 or a2 or a3 a200) and (b1
or b2 or b3 or b4 . b400)",I found it will take vey long time(40seconds) to
get the the answer in only one field(Title field),and JV
