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 you describe how this compact forwarded index works? > Similar to FieldCache idea but more compact. Does this also use FieldCacheRangeFilter and/or FieldCacheTermsFilter? Regards, Paul Elschot
