Bitmat: a main memory rdf triple store

From Semantic Portal Wiki

Edit

Reference:

1. Medha Atre, Jagannathan Srinivasan, James A. Hendler. BitMat: A Main Memory RDF Triple Store , Tetherless World Constellation (TW-2009-02), 2009

bibtex

@techreport { atre2009bitmat: ,
  author = "Medha Atre, Jagannathan Srinivasan, James A. Hendler", 
institution = "Tetherless World Constellation", 
number = "TW-2009-02", 
title = "BitMat: A Main Memory RDF Triple Store", 
year = "2009", 
} 

abstract: 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.

download:

• paper: TW-2009-02.pdf (http://www.cs.rpi.edu/%7Eatrem/bitmat_techrep.pdf)
• slides: