poster

Answering provenance-aware regular path queries on RDF graphs using an automata-based algorithm

Authors:

Zhiyong FengAuthors Info & Claims

WWW '14 Companion: Proceedings of the 23rd International Conference on World Wide Web

Pages 395 - 396

https://doi.org/10.1145/2567948.2577284

Published: 07 April 2014 Publication History

Get Access

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.

References

[1]

S. Dey, V. Cuevas-Vicenttın, S. Köhler, E. Gribkoff, M. Wang, and B. Lud\"ascher. On implementing provenance-aware regular path queries with relational query engines. In Proceedings of EDBT/ICDT, pages 214--223. ACM, 2013.

Digital Library

Google Scholar

[2]

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In Proceedings of SIGMOD, pages 135--146. ACM, 2010.

Digital Library

Google Scholar

[3]

The Apache Software Foundation. Apache Giraph. http://giraph.apache.org/, 2013.

Google Scholar

Cited By

View all

Wang XWang SXin YYang YLi JWang X(2019)Distributed Pregel-based provenance-aware regular path query processing on RDF knowledge graphsWorld Wide Web10.1007/s11280-019-00739-0Online publication date: 14-Nov-2019
https://doi.org/10.1007/s11280-019-00739-0
Xin YZhang BWang XXu QFeng ZChampin PGandon FMédini LLalmas MIpeirotis P(2018)P3RPQCompanion Proceedings of the The Web Conference 201810.1145/3184558.3186908(19-20)Online publication date: 23-Apr-2018
https://dl.acm.org/doi/10.1145/3184558.3186908
Xin YWang XJin DWang S(2018)Distributed Efficient Provenance-Aware Regular Path Queries on Large RDF GraphsDatabase Systems for Advanced Applications10.1007/978-3-319-91452-7_49(766-782)Online publication date: 13-May-2018
https://doi.org/10.1007/978-3-319-91452-7_49
Show More Cited By

Index Terms

Answering provenance-aware regular path queries on RDF graphs using an automata-based algorithm
1. Information systems
  1. Data management systems
    1. Database management system engines

Recommendations

On implementing provenance-aware regular path queries with relational query engines
EDBT '13: Proceedings of the Joint EDBT/ICDT 2013 Workshops

Use of graphs is growing rapidly in social networks, semantic web, biological databases, scientific workflow provenance, and other areas. Regular Path Queries (RPQs) can be seen as a core graph query language to answer pattern-based reachability ...
Distributed Efficient Provenance-Aware Regular Path Queries on Large RDF Graphs
Database Systems for Advanced Applications
Abstract
With the proliferation of knowledge graphs, massive RDF graphs have been published on the Web. As an essential type of queries for RDF graphs, Regular Path Queries (RPQs) have been attracting increasing research efforts. However, the existing ...
Distributed Pregel-based provenance-aware regular path query processing on RDF knowledge graphs
Abstract
With the proliferation of knowledge graphs, massive RDF graphs have been published on the Web. As an essential type of queries for RDF graphs, Regular Path Queries (RPQs) have been attracting increasing research efforts. However, the existing ...

Comments

Information & Contributors

Information

Published In

WWW '14 Companion: Proceedings of the 23rd International Conference on World Wide Web

April 2014

1396 pages

ISBN:9781450327459

DOI:10.1145/2567948

General Chair:
Chin-Wan Chung
Korea Advanced Institute of Science and Technology, Korea
,
Program Chairs:
Andrei Broder
Google Inc., USA
,
Kyuseok Shim
Seoul National University, Korea
,
Torsten Suel
New York University, USA

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

In-Cooperation

SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 April 2014

Check for updates

Author Tags

Qualifiers

Poster

Funding Sources

Conference

WWW '14

Sponsor:

IW3C2

WWW '14: 23rd International World Wide Web Conference

April 7 - 11, 2014

Seoul, Korea

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
163
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 14 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang XWang SXin YYang YLi JWang X(2019)Distributed Pregel-based provenance-aware regular path query processing on RDF knowledge graphsWorld Wide Web10.1007/s11280-019-00739-0Online publication date: 14-Nov-2019
https://doi.org/10.1007/s11280-019-00739-0
Xin YZhang BWang XXu QFeng ZChampin PGandon FMédini LLalmas MIpeirotis P(2018)P3RPQCompanion Proceedings of the The Web Conference 201810.1145/3184558.3186908(19-20)Online publication date: 23-Apr-2018
https://dl.acm.org/doi/10.1145/3184558.3186908
Xin YWang XJin DWang S(2018)Distributed Efficient Provenance-Aware Regular Path Queries on Large RDF GraphsDatabase Systems for Advanced Applications10.1007/978-3-319-91452-7_49(766-782)Online publication date: 13-May-2018
https://doi.org/10.1007/978-3-319-91452-7_49
Andronikos TSingh AGiannakis KSioutas S(2018)Computing Probabilistic Queries in the Presence of Uncertainty via Probabilistic AutomataAlgorithmic Aspects of Cloud Computing10.1007/978-3-319-74875-7_7(106-120)Online publication date: 28-Jan-2018
https://doi.org/10.1007/978-3-319-74875-7_7
Wang XWang J(2016)ProvRPQ: An Interactive Tool for Provenance-Aware Regular Path Queries on RDF GraphsDatabases Theory and Applications10.1007/978-3-319-46922-5_44(480-484)Online publication date: 21-Sep-2016
https://doi.org/10.1007/978-3-319-46922-5_44

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On implementing provenance-aware regular path queries with relational query engines

Distributed Efficient Provenance-Aware Regular Path Queries on Large RDF Graphs

Distributed Pregel-based provenance-aware regular path query processing on RDF knowledge graphs