lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Paul Elschot <>
Subject Re: 2.4 Performance
Date Wed, 19 Nov 2008 16:44:33 GMT
Op Wednesday 19 November 2008 03:39:01 schreef
> Our design is roughly as follows: we have some pre-query filters,
> queries typically involving around 25 clauses, and some
> post-processing of hits. We collect counts and filter post query
> using a hit collector, which uses the (now deprecated) bits() method
> of Filters.
> I looked at converting us to use the new DocIdSet infrastructure (to
> gain the supposed 30% speed bump), but this seems to be somewhat
> problematic as there is no guarantee for whether we will get back a
> set we can do binary operations on (for example, if we get back a
> SortedVIntList, we're pretty much out of luck - the cardinality of
> the set is large (as it's a sortedvintlist), so we can't coerce it
> into another type, and it doesn't have the set operations we need to
> use it directly.

Is this part of the problem

Also consider o.a.l.util.OpenBitSetDISI, and how that is used in

Paul Elschot

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message