Ok, I've restructured the tests and am now seeing performance differences
very close to the claims in the javadocs. Thanks much, Yonik and Hoss.
Took 953ms to get 5000 bitset intersection counts
Took 516ms to get 5000 openbitset intersection counts
New code...
public void testMultipleOpenBi
You are essentially testing sets of size 5000 against sets of size 500,000.
BitSet keeps track of the largest bit you set (which is 5000) and
doesn't actually calculate the intersection or the populationCount
beyond that. OpenBitSet does not (it tries to do the minimum
necessary and make everythi
DocSets will be your friend ... the fact that Solr will choose between
HashDocSets and BitDocSets depending on how many set docs there are in a
particular set is your friend's really cool roomate, and the filterCache
will be your friend's really sweet apartment -- both of which will make
your fri
: Took 421ms to get 5000 bitset intersection counts
: Took 1465ms to get 5000 openbitset intersection counts
:
: ...and I'm wondering what I've done wrong. The results are consistent
: across differenct jvms and different hardware setups. I'm using the 7/22
: nightly of Solr. See my test code b
Hello all,
I'm newish to both Lucene and Solr, but I'm loving learning both. I was
intrigued by the comments in the OpenBitSet javadocs...
OpenBitSet is faster than java.util.BitSet in most operations and *much*
faster at calculating cardinality of sets and results of set operations.
...so I
