lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Paul Elschot <>
Subject Re: Faceted search with OpenBitSet/SortedVIntList
Date Sun, 08 Feb 2009 10:40:57 GMT

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 you describe how this compact forwarded index works?

> Similar to FieldCache idea but more compact.

Does this also use FieldCacheRangeFilter and/or FieldCacheTermsFilter?

Paul Elschot

  • Unnamed multipart/alternative (inline, 7-Bit, 0 bytes)
View raw message