BitMat: A Main Memory RDF Triple Store

TW-2009-02

Citation: Medha Atre,Jagannathan Srinivasan,James A. Hendler. (2009) BitMat: A Main Memory RDF Triple Store. In , January,2009.

Publication techreport ( Edit )
type	Technical Report
bibtype	techreport
Bibtex basics
author	Medha Atre;Jagannathan Srinivasan;James A. Hendler
title	BitMat: A Main Memory RDF Triple Store
year	2009
month	January
Bibtex more
Access Paper
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.
paper url	http://www.cs.rpi.edu/~atrem/bitmat_techrep.pdf

Abstract	BitMat is a main memory based bit-matrix s … 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. lion), and discuss the use case scenarios.
Author	Medha Atre +, Jagannathan Srinivasan +, and James A. Hendler +
Bibtype	techreport +
Has author	Medha Atre +, Jagannathan Srinivasan +, and James A. Hendler +
Has identifier	TW-2009-02 +
Has publishing details	January,2009 +
Has title	BitMat: A Main Memory RDF Triple Store +
Has tr id	TW-2009-02 +
Has year	2009 +
Month	January +
Paper url	http://www.cs.rpi.edu/~atrem/bitmat_techrep.pdf +
Title	BitMat: A Main Memory RDF Triple Store +
Year	2009 +