TY - GEN
T1 - TripleProv
T2 - 23rd International Conference on World Wide Web, WWW 2014
AU - Wylot, Marcin
AU - Cudré-Mauroux, Philippe
AU - Groth, Paul
PY - 2014/4/7
Y1 - 2014/4/7
N2 - Given the heterogeneity of the data one can find on the Linked Data cloud, being able to trace back the provenance of query results is rapidly becoming a must-have feature of RDF systems. While provenance models have been extensively discussed in recent years, little attention has been given to the efficient implementation of provenance-enabled queries inside data stores. This paper introduces TripleProv: a new system extending a native RDF store to efficiently handle such queries. TripleProv implements two different storage models to physically co-locate lineage and instance data, and for each of them implements algorithms for tracing provenance at two granularity levels. In the following, we present the overall architecture of our system, its different lineage storage models, and the various query execution strategies we have implemented to efficiently answer provenance-enabled queries. In addition, we present the results of a comprehensive empirical evaluation of our system over two different datasets and workloads. Copyright is held by the International World Wide Web Conference Committee (IW3C2).
AB - Given the heterogeneity of the data one can find on the Linked Data cloud, being able to trace back the provenance of query results is rapidly becoming a must-have feature of RDF systems. While provenance models have been extensively discussed in recent years, little attention has been given to the efficient implementation of provenance-enabled queries inside data stores. This paper introduces TripleProv: a new system extending a native RDF store to efficiently handle such queries. TripleProv implements two different storage models to physically co-locate lineage and instance data, and for each of them implements algorithms for tracing provenance at two granularity levels. In the following, we present the overall architecture of our system, its different lineage storage models, and the various query execution strategies we have implemented to efficiently answer provenance-enabled queries. In addition, we present the results of a comprehensive empirical evaluation of our system over two different datasets and workloads. Copyright is held by the International World Wide Web Conference Committee (IW3C2).
KW - Linked Open Data
KW - Provenance Polynomials
KW - Provenance Queries
KW - RDF
UR - http://www.scopus.com/inward/record.url?scp=84909608092&partnerID=8YFLogxK
U2 - 10.1145/2566486.2568014
DO - 10.1145/2566486.2568014
M3 - Contribución a la conferencia
AN - SCOPUS:84909608092
T3 - WWW 2014 - Proceedings of the 23rd International Conference on World Wide Web
SP - 455
EP - 465
BT - WWW 2014 - Proceedings of the 23rd International Conference on World Wide Web
PB - Association for Computing Machinery
Y2 - 7 April 2014 through 11 April 2014
ER -