There are several overloaded functions called equiJoin & rangeJoin defined in ibin.h, what role do they play ?
Thanks, Min On Thu, Jan 21, 2010 at 1:47 PM, K. John Wu <[email protected]> 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 > -- My research interests are distributed systems, parallel computing and bytecode based virtual machine. My profile: http://www.linkedin.com/in/coderplay My blog: http://coderplay.javaeye.com _______________________________________________ FastBit-users mailing list [email protected] https://hpcrdm.lbl.gov/cgi-bin/mailman/listinfo/fastbit-users
