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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Iannone, L., Palmisano, I., & Redavid, D. (2005). Optimizing RDF storage removing redundancies: An algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3533 LNAI, pp. 732–742). Springer Verlag. https://doi.org/10.1007/11504894_101
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
