Hi, Andrew, This is something we are doing on the research side. You can find the paper at <http://doi.acm.org/10.1145/1645953.1646083>.
John On 1/25/2010 10:34 AM, Andrew Olson wrote: > What is the join code "based on the new bitmap cross products"? > > Just curious, > Andrew > > On Jan 21, 2010, at 12:47 AM, K. John Wu wrote: > >> Hi, Min, >> >> There are some join code based on in-memory sort-merge join algorithm, >> but not based on the new bitmap cross products. There is a join class >> that represent some simply joins. You will need to use C++ to access it. >> >> John >> >> >> On 1/20/2010 9:28 PM, Min Zhou wrote: >>> Hi Kamesh& John, >>> >>> A few days ago, I saw your paper, Efficient Joins with Compressed >>> Bitmap Indexes. Do you implmented the algorithms presented by that >>> paper, such as CP-EqJoin, CP-RangeJoin , CP-JoinCount, >>> CP-FastRangeJoin in the current version of fastbit(v 1.1.5)? If did, >>> where are they? >>> >>> >>> >>> Thanks, >>> Min >> _______________________________________________ >> FastBit-users mailing list >> [email protected] >> https://hpcrdm.lbl.gov/cgi-bin/mailman/listinfo/fastbit-users > > _______________________________________________ > FastBit-users mailing list > [email protected] > https://hpcrdm.lbl.gov/cgi-bin/mailman/listinfo/fastbit-users _______________________________________________ FastBit-users mailing list [email protected] https://hpcrdm.lbl.gov/cgi-bin/mailman/listinfo/fastbit-users
