PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Zneika M., Lucchese C., Vodislav D., Kotzinos D. Summarizing linked data rdf graphs using approximate graph pattern mining. In: EDBT '16 - 19th International Conference on Extending Database Technology (Bordeaux, France, 15-18 March 2016). Abstract, pp. 684 - 685. OpenProceedings, 2016.
 
 
Abstract
(English)
The Linked Open Data (LOD) cloud brings together infor- mation described in RDF and stored on the web in (possi- bly 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 in- formation. 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.
URL: http://dx.doi.org/10.5441/002/edbt.2016.86
DOI: 10.5441/002/edbt.2016.86
Subject Linked Open Data
RDF Summarization
Query Processing
H.3.3 INFORMATION STORAGE AND RETRIEVAL. Information Search and Retrieval


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional