Skip to Main content Skip to Navigation
Conference papers

LiteMat: A scalable, cost-efficient inference encoding scheme for large RDF graphs

Abstract : The number of linked data sources and the size of the linked open data graph keep growing every day. As a consequence, semantic RDF services are more and more confronted with various "big data" problems. Query processing in the presence of inferences is one them. For instance, to complete the answer set of SPARQL queries, RDF database systems evaluate semantic RDFS relationships (subPropertyOf, subClassOf) through time-consuming query rewriting algorithms or space-consuming data materialization solutions. To reduce the memory footprint and ease the exchange of large datasets, these systems generally apply a dictionary approach for compressing triple data sizes by replacing resource identifiers (IRIs), blank nodes and literals with integer values. In this article, we present a structured resource identification scheme using a clever encoding of concepts and property hierarchies for efficiently evaluating the main common RDFS entailment rules while minimizing triple materialization and query rewriting. We will show how this encoding can be computed by a scalable parallel algorithm and directly be implemented over the Apache Spark framework. The efficiency of our encoding scheme is emphasized by an evaluation conducted over both synthetic and real world datasets.
Complete list of metadata
Contributor : Olivier Curé Connect in order to contact the contributor
Submitted on : Thursday, March 22, 2018 - 10:32:18 AM
Last modification on : Saturday, January 15, 2022 - 3:56:20 AM

Links full text



Olivier Curé, Hubert Naacke, Tendry Randriamalala, Bernd Amann. LiteMat: A scalable, cost-efficient inference encoding scheme for large RDF graphs. 2015 IEEE International Conference on Big Data (Big Data), Oct 2015, Santa Clara, CA, United States. pp.1823-1830, ⟨10.1109/BigData.2015.7363955⟩. ⟨hal-01740588⟩



Record views