RDF compression: basic approaches

Authors:
Javier D. Fernández;Claudio Gutierrez;Miguel A. Martínez-Prieto
Affiliations:
University of Valladolid, Valladolid, Spain;University of Chile, Santiago, Chile;University of Valladolid, Valladolid, Spain
Venue:
Proceedings of the 19th international conference on World wide web
Year:
2010

Citing 2
Cited 5

The webgraph framework I: compression techniques

Proceedings of the 13th international conference on World Wide Web
Characterizing the semantic web on the web

ISWC'06 Proceedings of the 5th international conference on The Semantic Web

Compact representation of large RDF data sets for publishing and exchange

ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Binary RDF for scalable publishing, exchanging and consumption in the web of data

Proceedings of the 21st international conference companion on World Wide Web
An empirical survey of Linked Data conformance

Web Semantics: Science, Services and Agents on the World Wide Web
Scalable RDF data compression with MapReduce

Concurrency and Computation: Practice & Experience
Binary RDF representation for publication and exchange (HDT)

Web Semantics: Science, Services and Agents on the World Wide Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URIs and RDF syntax verbosity. We present basic approaches to compress RDF data and test them with three well-known, real-world RDF data sets.