HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

DFS-based frequent graph pattern extraction to characterize the content of RDF Triple Stores

Abstract : Semantic web applications often access distributed triple stores relying on different ontologies and maintaining bases of RDF annotations about different domains. Use cases often involve queries which results combine pieces of annotations distributed over several bases maintained on different servers. In this context, one key issue is to characterize the content of RDF bases to be able to identify their potential contributions to the processing of a query. In this paper we propose an algorithm to extract a compact representation of the content of an RDF repository. We first improve the canonical representation of RDF graphs based on DFS code proposed in the literature. We then provide a join operator to significantly reduce the number of frequent graph patterns generated from the analysis of the content of the base, and we reduce the index size by keeping only the graph patterns with maximal coverage. Our algorithm has been tested on different data sets as discussed in conclusion.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

Contributor : Fabien Gandon Connect in order to contact the contributor
Submitted on : Thursday, July 2, 2015 - 2:46:03 PM
Last modification on : Sunday, May 1, 2022 - 3:14:32 AM
Long-term archiving on: : Tuesday, April 25, 2017 - 9:56:56 PM


Files produced by the author(s)


  • HAL Id : hal-01170896, version 1



Adrien Basse, Fabien Gandon, Isabelle Mirbel, Moussa Lo. DFS-based frequent graph pattern extraction to characterize the content of RDF Triple Stores. Web Science Conference 2010 (WebSci10), Apr 2010, Raleigh, United States. ⟨hal-01170896⟩



Record views


Files downloads