Scalable Saturation of Streaming RDF Triples - LAMSADE (Laboratoire d'Analyse et de Modélisation des Systèmes pour l'Aide à la Décision) Accéder directement au contenu
Article Dans Une Revue Transactions on Large-Scale Data- and Knowledge-Centered Systems Année : 2020

Scalable Saturation of Streaming RDF Triples

Résumé

In the Big Data era, RDF data are produced in high volumes. While there exist proposals for reasoning over large RDF graphs using big data platforms, there is a dearth of solutions that do so in environments where RDF data are dynamic, and where new instance and schema triples can arrive at any time. In this work, we present the first solution for reasoning over large streams of RDF data using big data platforms. In doing so, we focus on the saturation operation, which seeks to infer implicit RDF triples given RDF Schema or OWL constraints. Indeed, unlike existing solutions which saturate RDF data in bulk, our solution carefully identifies the fragment of the existing (and already saturated) RDF dataset that needs to be considered given the fresh RDF statements delivered by the stream. Thereby, it performs the saturation in an incremental manner. Experimental analysis shows that our solution outperforms existing bulk-based saturation solutions.

Domaines

Informatique

Dates et versions

hal-03118312 , version 1 (22-01-2021)

Identifiants

Citer

Mohammad Amin Farvardin, Dario Colazzo, Khalid Belhajjame, Carlo Sartiani. Scalable Saturation of Streaming RDF Triples. Transactions on Large-Scale Data- and Knowledge-Centered Systems, 2020, 12380, pp.1-40. ⟨10.1007/978-3-662-62271-1_1⟩. ⟨hal-03118312⟩
63 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More