Optimizing RDF storage removing redundancies: an algorithm

Authors:
Luigi Iannone;Ignazio Palmisano;Domenico Redavid
Affiliations:
Dipartimento di Informatica, Università degli Studi di Bari, Bari, Italy;Dipartimento di Informatica, Università degli Studi di Bari, Bari, Italy;Dipartimento di Informatica, Università degli Studi di Bari, Bari, Italy
Venue:
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Year:
2005

Citing 2
Cited 2

Jena: A Semantic Web Toolkit

IEEE Internet Computing
Foundations of semantic web databases

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Towards Rule-Based Minimization of RDF Graphs under Constraints

RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
REDD: an algorithm for redundancy detection in RDF models

ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Semantic Web relies on Resource Description Framework (RDF). Because of the very simple RDF Model and Syntax, the managing of RDF-based knowledge bases requires to take into account both scalability and storage space consumption. In particular, blank nodes semantics came up recently with very interesting theoretical results that can lead to various techniques that optimize, among others, space requirements in storing RDF descriptions. We present a prototypical evolution of our system called RDFCore that exploits these theoretical results and reduces the storage space for RDF descriptions.