REDD: an algorithm for redundancy detection in RDF models

Authors:
Floriana Esposito;Luigi Iannone;Ignazio Palmisano;Domenico Redavid;Giovanni Semeraro
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;Dipartimento di Informatica, Universitá degli Studi di Bari, Bari, Italy;Dipartimento di Informatica, Universitá degli Studi di Bari, Bari, Italy
Venue:
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Year:
2005

Citing 3
Cited 4

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
Optimizing RDF storage removing redundancies: an algorithm

IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence

Towards Rule-Based Minimization of RDF Graphs under Constraints

RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
A RDF-based framework for user profile creation and management

KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Contextualization of a RDF knowledge base in the VIKEF project

ICADL'06 Proceedings of the 9th international conference on Asian Digital Libraries: achievements, Challenges and Opportunities
Foundational aspects of semantic web optimization

PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

The base of Semantic Web specifications is Resource Description Framework (RDF) as a standard for expressing metadata. RDF has a simple object model, allowing for easy design of knowledge bases. This implies that the size of knowledge bases can dramatically increase; therefore, it is necessary to take into account both scalability and space consumption when storing such bases. Some theoretical results related to blank node semantics can be exploited in order to design techniques that optimize, among others, space requirements in storing RDF descriptions. We present an algorithm, called REDD, that exploits these theoretical results and optimizes the space used by a RDF description.