Data Compression and Fast Search for Large RDF Graphs

Abstract

RDF data stores need to search for metadata quickly from large scale RDF data, such as Gene Ontology and DBpedia. We present a compressed index structure of RDF data in order to develop a fast in-memory RDF database system (called FROST) that compactly stores RDF triples. We show the advantage of FROST, using the LUBM dataset (a benchmarking framework for semantic repositories).