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.
|Data di pubblicazione:||2016|
|Titolo:||Summarizing Linked Data RDF Graphs Using Approximate Graph Pattern Mining|
|Titolo del libro:||Proceedings of the 19th International Conference on Extending Database Technology|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.5441/002/edbt.2016.86|
|Appare nelle tipologie:||4.3 Poster in Atti di convegno|