]> 2012-02-10T15:11:29-05:00 Bitmat: a main memory rdf triple store BitMat is a main memory based bit-matrix structure for representing a large set of RDF triples, designed primarily to allow processing of conjunctive triple pattern (join) queries. The key aspects are as follows: i) its RDF triple-set representation is compact compared to conventional disk-based and existing main-memory RDF stores, ii) basic join query processing employs logical bitwise AND/OR operations on parts of a BitMat, and iii) for multi-joins, intermediate results are maintained in the form of a BitMat containing candidate triples without complete materialization, thereby ensuring that the intermediate result size remains bounded across a large number of join operations, provided there are no Cartesian joins. We present the key concepts of the BitMat structure, its use in processing join queries, describe our experimental results with RDF datasets of different sizes (from 200k to 47 million), and discuss the use case scenarios. techreport atre2009bitmat: TW-2009-02 BitMat: A Main Memory RDF Triple Store TW-2009-02 2009 Year Tr id Title Computer science Tag Paper url Media:TW-2009-02.pdf Paper Number January Month Key Tetherless World Constellation Institution Bibtype James A. Hendler Jagannathan Srinivasan Medha Atre Author Abstract TW Technical Report Publication Technical Report