Answering provenance-aware regular path queries on RDF graphs using an automata-based algorithm
Lists
Only you see this
Abstract
This paper presents an automata-based algorithm for answering the \emph{provenance-aware} regular path queries (RPQs) over RDF graphs on the Semantic Web. The provenance-aware RPQs can explain why pairs of nodes in the classical semantics appear in the result of an RPQ. We implement a parallel version of the automata-based algorithm using the Pregel framework Giraph to efficiently evaluate provenance-aware RPQs on large RDF graphs. The experimental results show that our algorithms are effective and efficient to answer provenance-aware RPQs on large real-world RDF graphs.
BibTeX
@inproceedings{wang2014answering,
author = {Xin Wang and Jun Ling and Junhu Wang and Kewen Wang and Zhiyong Feng},
title = {{Answering provenance-aware regular path queries on RDF graphs using an automata-based algorithm}},
booktitle = {The Web Conference},
year = {2014},
doi = {10.1145/2567948.2577284},
}Loading related content...