A good example would be a range query field, where there are a large number of possibilities, and caching the bit sets of the various ranges will not fit in the allotted cache size. Counting (faceting) over custom field caches can be more performant, especially if the number of facets calculated is many.
On Wed, Mar 25, 2009 at 7:55 AM, Otis Gospodnetic < otis_gospodne...@yahoo.com> wrote: > > Hi, > > At which point would you say the number of cached bitsets should be > considered excessive? Simply a function of bitset size (index size) and > memory/JVM heap? > > Otis > -- > Sematext -- http://sematext.com/ -- Lucene - Solr - Nutch > > > > ----- Original Message ---- > > From: Jason Rutherglen <jason.rutherg...@gmail.com> > > To: solr-dev@lucene.apache.org > > Sent: Tuesday, March 24, 2009 2:48:25 PM > > Subject: Re: LinkedIn open source project: kamikaze/lucene-ext > > > > http://bobo-browse.wiki.sourceforge.net/ > > > > For faceting, the Bobo library from LinkedIn may be useful in cases where > > the number of cached bitsets is excessive. > > > > On Sun, Mar 22, 2009 at 8:35 PM, Lance Norskog wrote: > > > > > LinkedIn open-sourced a pile of DocSet compression implementations as > > > "Lucene-Ext", or "kamikaze": > > > http://code.google.com/p/lucene-ext/wiki/Kamikaze > > > > > > Has anyone looked at using these in Solr? > > > > > > -- > > > Lance Norskog > > > goks...@gmail.com > > > 650-922-8831 (US) > > > > >
