Document Type

Conference Proceeding

Publication Date

1-1-2013

Abstract

Linked data has experienced accelerated growth in recent years. With the continuing proliferation of structured data, demand for RDF compression is becoming increasingly important. In this study, we introduce a novel lossless compression technique for RDF datasets, called Rule Based Compression (RB Compression) that compresses datasets by generating a set of new logical rules from the dataset and removing triples that can be inferred from these rules. Unlike other compression techniques, our approach not only takes advantage of syntactic verbosity and data redundancy but also utilizes semantic associations present in the RDF graph. Depending on the nature of the dataset, our system is able to prune more than 50% of the original triples without affecting data integrity.

Comments

Presented at the 10th International Conference on Logical Linked Data Compression, Montpellier, France, May 26th-30th, 2013.

The attached PDF document is the unpublished, peer-reviewed version of this article. The final version of this article can be found at http://dx.doi.org/10.1007/978-3-642-38288-8_12.

Paper also presented under the title Towards Logical Linked Data Compression at the Joint Workshop on Large and Heterogeneous Data and Quantitative Formalization in the Semantic Web, Boston, MA, November 2012.

DOI

10.1007/978-3-642-38288-8_12