Hi, Dominique, Regarding the test cases, whenever you are ready to share is fine.
Regarding the performance, my guess is that the bit vectors are more spread out in the new corrected approach. When the bit vectors are spread out, FastBit needs to read more bytes in order to get them out. If this is indeed the case, the thing to do might to sort the values before returning them from ibis::dictionary::patternSearch with something like std::sort(matches.begin(), matches.end()); John On 3/15/12 12:24 PM, Dominique Prunier wrote: > Hey John, > > The problem is that right know, my test suite mainly tests the > import and not so much the queries (i have maybe 10-20 test cases > that actually evaluates queries). It has been basically modeled > after our existing test suite for MySQL/Oracle and is supposed to > prove that the imported data is equivalent to our source. > > My next step is to do a micro testing framework to test queries. I > have a very simplistic example which only uses CATEGORY and LONG > (the only two types that we're using), but it is not convenient > enough to use. > > Be sure that i'll post in the group if i have something good enough > to be shared :) > > Regarding the bug i found yesterday, surprisingly enough, fixing it > changed the performance quite significantly. I'm still not sure why > (the number of selected bitmap was the same), but i'll try to > investigate a bit further. > > Thanks, > _______________________________________________ FastBit-users mailing list [email protected] https://hpcrdm.lbl.gov/cgi-bin/mailman/listinfo/fastbit-users
