Mailing-List: contact solr-user-help@lucene.apache.org; run by ezmlm
Precedence: bulk
Reply-To: solr-user@lucene.apache.org
Received-SPF: pass (nike.apache.org: domain of goksron@gmail.com designates
 209.85.221.191 as permitted sender)
DomainKey-Signature: a=rsa-sha1; c=nofws;
        d=gmail.com; s=gamma;
        h=mime-version:in-reply-to:references:date:message-id:subject:from:to
         :content-type:content-transfer-encoding;
        b=rrwrTGjE0oJ/tdBBsQ1dJprPvnpTUesTbrQyW2s4xEg5GM7FY8Mzf8FxQPz/UoCkSl
         PD+0lk7jcnjLSk0sNMR6kZp4eLU4778ifP+uDP6ZF+OsMRbE7oXWJTzodQXHax6zo3C6
         1/kmLm6W+i9cADzLJRkC4M+rzcO9+bdrPbFAg=
MIME-Version: 1.0
In-Reply-To: 
 <13D828CF2C5A6D4597111B6E6571FD6308FE1190B5@GMEXMBS2.globeandmail.net>
References: 
 <13D828CF2C5A6D4597111B6E6571FD6308FE1190B5@GMEXMBS2.globeandmail.net>
Date: Fri, 7 May 2010 20:18:28 -0700
Message-ID: <m2n87c998321005072018g9c17211bjfaf59dd3889fc29a@mail.gmail.com>
Subject: Re: caching repeated OR'd terms
From: Lance Norskog <goksron@gmail.com>
To: solr-user@lucene.apache.org
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

I would suggest benchmarking this before doing any more complex
design. A field with only 10k unique integer or string values will
search very very quickly.

On Thu, May 6, 2010 at 7:54 AM, Nagelberg, Kallin
<KNagelberg@globeandmail.com> wrote:
> Hey everyone,
>
> I'm having some difficulty figuring out the best way to optimize for a ce=
rtain query situation. My documents have a many-valued field that stores li=
sts of IDs. All in all there are probably about 10,000 distinct IDs through=
out my index. I need to be able to query and find all documents that contai=
n a given set of IDs. Ie, I want to find all documents that contain IDs 3, =
202, 3030 or 505. Currently I'm implementing this like so:
>
> q=3D (myfield:3) OR (myfield:202) OR (myfield:3030) OR (myfield:505).
>
> It's possible that there could be upwards of hundreds of terms, although =
90% of the time it will be under 10. Ideally I would like to do this with a=
 filter query, but I have read that it is impossible to cache OR'd terms in=
 a fq, though this feature may come soon. The problem is that the combinati=
ons of OR'd terms will almost always be unique, so the query cache will hav=
e a very low hit rate. It would be great if the individual terms could be c=
ached individually, but I'm not sure how to accomplish that.
>
> Any suggestions would be welcome!
> -Kallin Nagelberg
>
>


--=20
Lance Norskog
goksron@gmail.com