Summarizing Linked Data RDF Graphs Using Approximate Graph Pattern Mining - ETIS, équipe MIDI Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Summarizing Linked Data RDF Graphs Using Approximate Graph Pattern Mining

Résumé

The Linked Open Data (LOD) cloud brings together information described in RDF and stored on the web in (possibly distributed) RDF Knowledge Bases (KBs). The data in these KBs are not necessarily described by a known schema and many times it is extremely time consuming to query all the interlinked KBs in order to acquire the necessary information. To tackle this problem, we propose a method of summarizing large RDF KBs using approximate RDF graph patterns and calculating the number of instances covered by each pattern. Then we transform the patterns to an RDF schema that describes the contents of the KB. Thus we can then query the RDF graph summary to identify whether the necessary information is present and if so its size, before deciding to include it in a federated query result.
Fichier principal
Vignette du fichier
paper-315 last version on line.pdf (343.02 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01416814 , version 1 (14-12-2016)

Identifiants

Citer

Mussab Zneika, Claudio Lucchese, Dan Vodislav, Dimitris Kotzinos. Summarizing Linked Data RDF Graphs Using Approximate Graph Pattern Mining. 19th International Conference on Extending Database Technology, Mar 2016, Bordeaux, France. ⟨10.5441/002/edbt.2016.86⟩. ⟨hal-01416814⟩
144 Consultations
112 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More