Have a look at decoupling Filter from BitSet: http://issues.apache.org/jira/browse/LUCENE-584
There also is a SortedVIntList there that stores document numbers more compactly than BitSet, and an implementation of CachingFilterQuery (iirc) that chooses the more compact representation of BitSet and SortedVIntList. Regards, Paul Elschot On Saturday 27 October 2007 02:15:48 Yonik Seeley wrote: > On 10/26/07, John Patterson <[EMAIL PROTECTED]> wrote: > > Thom Nelson wrote: > > > Check out the HashDocSet from Solr, this is the best way to cache small > > > sets of search results. In general, the Solr BitSet/DocSet classes are > > > more efficient than using the standard java.util.BitSet. You can use > > > these independent of the rest of Solr (though I recommend checking out > > > Solr if you want to do complex caching). > > > > I imagine the fastest way to combine cached results is to store them in > > an array ordered by doc number so that the ConjunctionQuery can use them > > directly. The Javadoc for HashDocSet says that they are stored out of > > order which would make this impossible. > > You're speaking at quite an abstract level... it really depends on > what specific issue you are seeing that you're trying to solve. > > -Yonik > > --------------------------------------------------------------------- > To unsubscribe, e-mail: [EMAIL PROTECTED] > For additional commands, e-mail: [EMAIL PROTECTED] --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
