Answering provenance-aware regular path queries on RDF graphs using an automata-based algorithm
Author(s)
Wang, Xin
Ling, Jun
Wang, Junhu
Wang, Kewen
Feng, Zhiyong
Year published
2014
Metadata
Show full item recordAbstract
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.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.
View less >
View less >
Conference Title
WWW'14 COMPANION: PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON WORLD WIDE WEB
Subject
Database systems