Hi Chris,
The "SortedVIntList" approach is similar to field cache. It's better to use
> the fieldcache for the facet search, which is the "normal" approach and
> used
> in tools like Solr, DBSight, Bobo Browse Engine, etc.
Thanks for your answer, I did not know about FieldCache.
However, I think
Hi Paul,
One way to implement that would be to use one of the boolean combination
> filters in contrib, BooleanFilter or ChainedFilter, and simply count the
> the number of times next() returns true on the result.
I am sorry, but I cannot understand: how can I create a BooleanFilter or a
Chaine
On Feb 8, 2009, at 3:32 AM, Raffaella Ventaglio wrote:
Hi Chris,
The "SortedVIntList" approach is similar to field cache. It's better
to use
the fieldcache for the facet search, which is the "normal" approach
and
used
in tools like Solr, DBSight, Bobo Browse Engine, etc.
Thanks for you
I would do so, it's really simple, you can even do it in an anonymous inner
class.
-
UWE SCHINDLER
Webserver/Middleware Development
PANGAEA - Publishing Network for Geoscientific and Environmental Data
MARUM - University of Bremen
Room 2500, Leobener Str., D-28359 Bremen
Tel.: +49 421 218 6559
John,
On Sunday 08 February 2009 00:35:10 John Wang wrote:
> Our implementation of facet search can handle this. Using bitsets for
> intersection is not scalable performance wise when index is large.
>
> We are using a compact forwarded index representation in memory for the
> counting.
Could yo
On Sunday 08 February 2009 09:53:00 Uwe Schindler wrote:
> I would do so, it's really simple, you can even do it in an anonymous inner
> class.
It is indeed simple, but it might also help to take a look at the source code
of the Lucene classes involved.
Regards,
Paul Elschot
>
> -
> UWE SCH
Hi Paul:
Took a little time to find these classes, they are post-2.4 additions I
think.
Our representation:
1) We do not build on top of the FieldCacheImpl class for a few reasons: It
is keyed off of the IndexReader, and application cannot clear the cache, and
we assume indexes can upd
