research-article

Query Planning for Evaluating SPARQL Property Paths

Authors:

Nikolay Yakovets,

Jarek GryzAuthors Info & Claims

SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data

Pages 1875 - 1889

https://doi.org/10.1145/2882903.2882944

Published: 26 June 2016 Publication History

Abstract

The extension of SPARQL in version 1.1 with property paths offers a type of regular path query for RDF graph databases. Such queries are difficult to optimize and evaluate efficiently, however. We have embarked on a project, Waveguide, to build a cost-based optimizer for SPARQL queries with property paths. Waveguide builds a query plan--- which we call a waveplan (WP)--- which guides the query evaluation. There are numerous choices in the construction of a plan, and a number of optimization methods, so the space of plans for a query can be quite large. Execution costs of plans for the same query can vary by orders of magnitude. A WGP's costs can be estimated, which opens the way to cost-based optimization. We demonstrate that the plan space of Waveguide properly subsumes existing techniques and that the new plans it adds are relevant.

References

[1]

S. Abiteboul, R. Hull, and V. Vianu. Foundations of databases, volume 8. Addison-Wesley, 1995.

Digital Library

[2]

S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener. The Lorel query language for semistructured data. International Journal on Digital Libraries, 1(1):68--88, 1997.

[3]

R. Agrawal. Alpha: An extension of relational algebra to express a class of recursive queries. Software Engineering, IEEE Transactions on, 14(7):879--885, 1988.

Digital Library

[4]

P. Barcelo, L. Libkin, A. W. Lin, and P. T. Wood. Expressive languages for path queries over graph-structured data. Transactions on Database Systems, 37(4):31, 2012.

Digital Library

[5]

M. Bojanczyk. Automata for data words and data trees. In RTA, pages 1--4, 2010.

[6]

P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu. A query language and optimization techniques for unstructured data. SIGMOD Record, 25(2):505--516, 1996.

Digital Library

[7]

D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. Rewriting of regular expressions and regular path queries. In Proceedings of the Symposium on Principles of Database Systems, pages 194--204. ACM, 1999.

Digital Library

[8]

J. J. Carroll, I. Dickinson, C. Dollin, D. Reynolds, A. Seaborne, and K. Wilkinson. Jena: implementing the semantic web recommendations. In Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, pages 74--83. ACM, 2004.

Digital Library

[9]

M. P. Consens, A. O. Mendelzon, D. Vista, and P. T. Wood. Constant propagation versus join reordering in datalog. In Rules in Database Systems, pages 245--259. Springer, 1995.

Digital Library

[10]

The DBpedia knowledge base. http://dbpedia.org/.

[11]

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

Digital Library

[12]

O. Erling and I. Mikhailov. Virtuoso: RDF Support in Native RDBMS. Semantic Web Information Management, 1:501, 2010.

[13]

D. Florescu, A. Y. Levy, and A. O. Mendelzon. Database techniques for the world-wide web: A survey. SIGMOD Record, 27(3):59--74, 1998.

Digital Library

[14]

S. Harris and A. Seaborne. SPARQL 1.1 query language. W3C working draft. http://www.w3.org/TR/sparql11-query/, November 2012.

[15]

K. J. Kochut and M. Janik. Sparqler: Extended sparql for semantic association discovery. In The Semantic Web: Research and Applications, pages 145--159. Springer, 2007.

Digital Library

[16]

A. Koschmieder and U. Leser. Regular path queries on large graphs. In Scientific and Statistical Database Management, pages 177--194. Springer Berlin Heidelberg, 2012.

Digital Library

[17]

K. Losemann and W. Martens. The complexity of evaluating path expressions in SPARQL. In Proceedings of the 31st symposium on Principles of Database Systems, pages 101--112. ACM, 2012.

Digital Library

[18]

A. Mendelzon and P. Wood. Finding regular simple paths in graph databases. SIAM Journal on Computing, 24(6):1235--1258, 1995.

Digital Library

[19]

J. Pérez, M. Arenas, and C. Gutierrez. nSPARQL: A navigational language for rdf. Web Semantics: Science, Services and Agents on the World Wide Web, 8(4):255--270, 2010.

Digital Library

[20]

E. Prud'Hommeaux, A. Seaborne, et al. SPARQL query language for RDF. W3C Recommendation, 15, 2008.

[21]

W3C: Resource Description Framework (RDF). http://www.w3.org/TR/rdf-concepts/, 2004.

[22]

L. Segoufin. Automata and logics for words and trees over an infinite alphabet. In Computer Science Logic, pages 41--57. Springer, 2006.

Digital Library

[23]

L. Segoufin. Static analysis of XML processing with data values. ACM Sigmod Record, 36(1):31--38, 2007.

Digital Library

[24]

YAGO2s: A high-quality knowledge base. http://yago-knowledge.org/resource/. Max Planck Institut Informatik.

[25]

N. Yakovets, P. Godfrey, and J. Gryz. Evaluation of SPARQL property paths via recursive SQL. In L. Bravo and M. Lenzerini, editors, AMW, volume 1087 of CEUR Workshop Proceedings. CEUR-WS.org, May 2013.

[26]

N. Yakovets, P. Godfrey, and J. Gryz. WAVEGUIDE: evaluating SPARQL property path queries. In Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, Brussels, Belgium, March 23--27, 2015., pages 525--528, 2015.

[27]

H. Zauner, B. Linse, T. Furche, and F. Bry. A RPL through RDF: expressive navigation in RDF graphs. In Web Reasoning and Rule Systems, pages 251--257. Springer, 2010.

Digital Library

Cited By

Mulder TFletcher GYakovets N(2025)Optimizing navigational graph queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-024-00892-734:2Online publication date: 1-Mar-2025
https://dl.acm.org/doi/10.1007/s00778-024-00892-7
Pang YZou LYu JYang L(2024)Materialized View Selection & View-Based Query Planning for Regular Path QueriesProceedings of the ACM on Management of Data10.1145/36549552:3(1-26)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654955
Arroyuelo DGómez-Brandón ANavarro G(2024)Evaluating regular path queries on compressed adjacency matricesThe VLDB Journal10.1007/s00778-024-00885-634:1Online publication date: 26-Nov-2024
https://doi.org/10.1007/s00778-024-00885-6
Show More Cited By

Index Terms

Query Planning for Evaluating SPARQL Property Paths
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing

Recommendations

Foundations of SPARQL query optimization
ICDT '10: Proceedings of the 13th International Conference on Database Theory

We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic Web. Our key contributions are (i) a complete complexity analysis for all ...
SPARQL-to-SQL Query Translation: Bottom-Up or Top-Down?
SCC '11: Proceedings of the 2011 IEEE International Conference on Services Computing

Emerging Semantic Web Services rely on the availability of metadata that describes various functional and non-functional characteristics of computational resources. A number of semantic vocabularies and datasets describing existing services and ...
gTop: An Efficient SPARQL Query Engine
Web and Big Data
Abstract
In this demonstration, we present gTop, a top-k query engine based on gStore which supports SPARQL queries over RDF databases. gTop can answer top-k queries with high efficiency and scalability. We use the DP-B algorithm for top-k queries and the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '16: Proceedings of the 2016 International Conference on Management of Data

June 2016

2300 pages

ISBN:9781450335317

DOI:10.1145/2882903

General Chairs:
Fatma Özcan
IBM Research, USA
,
Georgia Koutrika
HP Labs, USA
,
Program Chair:
Sam Madden
Massachusetts Institute of Technology, USA

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 June 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMOD/PODS'16

Sponsor:

SIGMOD

SIGMOD/PODS'16: International Conference on Management of Data

June 26 - July 1, 2016

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
985
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)8

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mulder TFletcher GYakovets N(2025)Optimizing navigational graph queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-024-00892-734:2Online publication date: 1-Mar-2025
https://dl.acm.org/doi/10.1007/s00778-024-00892-7
Pang YZou LYu JYang L(2024)Materialized View Selection & View-Based Query Planning for Regular Path QueriesProceedings of the ACM on Management of Data10.1145/36549552:3(1-26)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654955
Arroyuelo DGómez-Brandón ANavarro G(2024)Evaluating regular path queries on compressed adjacency matricesThe VLDB Journal10.1007/s00778-024-00885-634:1Online publication date: 26-Nov-2024
https://doi.org/10.1007/s00778-024-00885-6
Farías BMartens WRojas CVrgoč D(2024)PathFinder: Returning Paths in Graph QueriesThe Semantic Web – ISWC 202410.1007/978-3-031-77850-6_8(135-154)Online publication date: 11-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-77850-6_8
Navarro GRobert J(2024)Compressed Graph Representations for Evaluating Regular Path QueriesString Processing and Information Retrieval10.1007/978-3-031-72200-4_17(218-232)Online publication date: 19-Sep-2024
https://doi.org/10.1007/978-3-031-72200-4_17
Karalis NBigerl AHeidrich LSherif MNgonga Ngomo A(2024)Efficient Evaluation of Conjunctive Regular Path Queries Using Multi-way JoinsThe Semantic Web10.1007/978-3-031-60626-7_12(218-235)Online publication date: 26-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-60626-7_12
Anadiotis AManolescu IMohanty M(2023)Integrating Connection Search in Graph Queries2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00200(2607-2620)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00200
Arroyuelo DGómez-Brandón AHogan ANavarro GRojas-Ledesma J(2023)Optimizing RPQs over a compact graph representationThe VLDB Journal10.1007/s00778-023-00811-233:2(349-374)Online publication date: 7-Sep-2023
https://doi.org/10.1007/s00778-023-00811-2
Arroyuelo DGómez-Brandón ANavarro G(2023)Evaluating Regular Path Queries on Compressed Adjacency MatricesString Processing and Information Retrieval10.1007/978-3-031-43980-3_4(35-48)Online publication date: 20-Sep-2023
https://doi.org/10.1007/978-3-031-43980-3_4
Aimonier-Davat JSkaf-Molli HMolli PDang MNédelec B(2023)Join Ordering of SPARQL Property Path QueriesThe Semantic Web10.1007/978-3-031-33455-9_3(38-54)Online publication date: 28-May-2023
https://dl.acm.org/doi/10.1007/978-3-031-33455-9_3
Show More Cited By

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten