));
Yonik had suggested distributed search. But I am not sure if we set every
configuration correctly. For example the solr caches if they are related
with faceted searching.
We use default values:
Any help is appreciated.
On Sun, Jun 6, 2010 at 8:54 PM, Yonik Seeley wrote:
> On Su
Ok, I will have a look at distributed search, multi-core solr solution.
Thank you Yonik,
On Sun, Jun 6, 2010 at 8:54 PM, Yonik Seeley wrote:
> On Sun, Jun 6, 2010 at 1:12 PM, Furkan Kuru wrote:
> > We try to provide real-time search. So the index is changing almost in
> ever
3:27 PM, Yonik Seeley wrote:
> On Sun, Jun 6, 2010 at 7:38 AM, Furkan Kuru wrote:
> > facet.limit = default value 100
> > facet.minCount is 1
> >
> > The document count that matches the query is 8-10K in average. I did not
> > calculate the terms (may
eturning the facet
> counts of all 1M of facet terms, or did you limit the number of facet terms
> returned to a small number?
>
> Also did your entire index fit within RAM?
>
>
> --- On Sat, 6/5/10, Furkan Kuru wrote:
>
> > From: Furkan Kuru
> > Subject: Re: F
er when a field has many unique terms. So how come
> enum, not fc, is faster in this case?
>
> facet.method=fc is faster when there are many unique terms, and
> relatively few terms per document. A full-text field doesn't fit that
> bill.
>
> > Also why use filterCache le
t; facet.method=enum
>
> And to use the filterCache less, try
> facet.enum.cache.minDf=100
>
> -Yonik
> http://www.lucidimagination.com
>
> On Fri, Jun 4, 2010 at 10:31 AM, Furkan Kuru wrote:
> > Hello,
> >
> > I have been dealing with real-time data.
> &g
query is appreciated.
Thanks in advance.
--
Furkan Kuru
top.
>
> facet1 [0]
> abc (20)
> def (18)
> ghi (16)
>
> facet2 [1]
> jkl (10)
> mno (9)
> pqr (2)
>
> thanks
>
> dev.
>
>
--
Furkan Kuru
?
--
Furkan Kuru
