Cited By
View all- 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
Join Ordering of SPARQL Property Path Queries
Authors: 
Julien Aimonier-Davat, Hala Skaf-Molli, 
Pascal Molli, Minh-Hoang Dang, Brice NédelecAuthors Info & Claims
Julien Aimonier-Davat, Hala Skaf-Molli, Pascal Molli, Minh-Hoang Dang, Brice NédelecAuthors Info & ClaimsPages 38 - 54
Abstract
SPARQL property path queries provide a succinct way to write complex navigational queries over RDF knowledge graphs. However, their evaluation remains difficult as they may involve the execution of transitive closures. As a result, many property path queries just time-out when executed on public online RDF knowledge graphs. One solution to speed up their execution is to find optimal join orders. Although the join ordering problem has been extensively studied for traditional SPARQL queries, the presence of property path patterns biases existing approaches. In this paper we focus on queries (conjunctive SPARQL property path queries with UNION and FILTER), and we present a query optimizer that is able to capture the cost of queries using an appropriate cost model and a sampling-based cardinality estimator. On the latest Wikidata Query Benchmark, we empirically demonstrate that our approach finds significantly better join orders than Virtuoso and BlazeGraph.
References
[1]
Aimonier-Davat J, Skaf-Molli H, Molli P, et al. Verborgh R et al. Processing SPARQL property path queries online with web preemption The Semantic Web 2021 Cham Springer 57-72
[2]
Ali, W., Saleem, M., Yao, B., Hogan, A., Ngomo, A.C.N.: A survey of RDF stores & SPARQL engines for querying knowledge graphs. VLDB J., 1–26 (2021)
[3]
Angles, R., Aranda, C.B., Hogan, A., Rojas, C., Vrgoč, D.: WDBench: a wikidata graph query benchmark. In: Angles, R., Aranda, C.B., Hogan, A., Rojas, C., Vrgoč, D., et al. (eds.) The Semantic Web—ISWC 2022. ISWC 2022. Lecture Notes in Computer Science, vol. 13489, pp. 714–731. Springer, Cham (2022).
[4]
Arroyuelo, D., Hogan, A., Navarro, G., Rojas-Ledesma, J.: Time-and space-efficient regular path queries. In: 38th International Conference on Data Engineering (ICDE), pp. 3091–3105. IEEE (2022)
[5]
Bonifati, A., Martens, W., Timm, T.: Navigating the maze of wikidata query logs. In: The World Wide Web Conference, pp. 127–138 (2019)
[6]
Buil-Aranda C, Hogan A, Umbrich J, Vandenbussche P-Y, et al. Alani H et al. SPARQL web-querying infrastructure: ready for action? The Semantic Web – ISWC 2013 2013 Heidelberg Springer 277-293
[7]
Cluet S and Moerkotte G Gottlob G and Vardi MY On the complexity of generating optimal left-deep processing trees with cross products Database Theory — ICDT ’95 1995 Heidelberg Springer 54-67
[8]
Erling, O., Mikhailov, I.: RDF support in the virtuoso DBMS. In: n: Pellegrini, T., Auer, S., Tochtermann, K., Schaffert, S. (eds.) Networked Knowledge - Networked Media. Studies in Computational Intelligence, vol. 221, pp. 7–24. Springer, Berlin, Heidelberg (2009).
[9]
Fernández JD, Martínez-Prieto MA, Gutiérrez C, Polleres A, and Arias M Binary RDF representation for publication and exchange (HDT) J. Web Seman. 2013 19 22-41
[10]
Gubichev, A.: Query processing and optimization in graph databases. Ph.D. thesis, Technische Universität München (2015)
[11]
Gubichev, A., Bedathur, S.J., Seufert, S.: Sparqling kleene: fast property paths in RDF-3x. In: First International Workshop on Graph Data Management Experiences and Systems, pp. 1–7 (2013)
[12]
Gubichev, A., Neumann, T.: Exploiting the query structure for efficient join ordering in SPARQL queries. In: 17th International Conference on Extending Database Technology, EDBT (2014)
[13]
Hertzschuch, A., Hartmann, C., Habich, D., Lehner, W.: Simplicity done right for join ordering. In: CIDR (2021)
[14]
Jachiet, L., Genevès, P., Gesbert, N., Layaïda, N.: On the optimization of recursive relational queries: application to graph queries. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 681–697 (2020)
[15]
Kader, R.A., Boncz, P.A., Manegold, S., van Keulen, M.: ROX: run-time optimization of XQueries. In: Çetintemel, U., Zdonik, S.B., Kossmann, D., Tatbul, N. (eds.) International Conference on Management of Data, SIGMOD. ACM (2009)
[16]
Kostylev EV, Reutter JL, Romero M, Vrgoč D, et al. Arenas M et al. SPARQL with property paths The Semantic Web - ISWC 2015 2015 Cham Springer 3-18
[17]
Leis V, Gubichev A, Mirchev A, Boncz PA, Kemper A, and Neumann T How good are query optimizers, really? VLDB Endow. 2015 9 3 204-215
[18]
Leis, V., Radke, B., Gubichev, A., Kemper, A., Neumann, T.: Cardinality estimation done right: Index-based join sampling. In: CIDR (2017)
[19]
Li, F., Wu, B., Yi, K., Zhao, Z.: Wander join and XDB: online aggregation via random walks. ACM Trans. Database Syst. 44(1), 1–41 (2019).
[20]
Losemann K and Martens W The complexity of regular expressions and property paths in SPARQL ACM Trans. Database Syst. (TODS) 2013 38 4 1-39
[21]
Malyshev S, Krötzsch M, González L, Gonsior J, Bielefeldt A, et al. Vrandečić D et al. Getting the most out of Wikidata: semantic technology usage in Wikipedia’s knowledge graph The Semantic Web – ISWC 2018 2018 Cham Springer 376-394
[22]
Neumann, T., Moerkotte, G.: Characteristic sets: accurate cardinality estimation for RDF queries with multiple joins. In: 27th International Conference on Data Engineering. IEEE (2011)
[23]
Park, Y., Ko, S., Bhowmick, S.S., Kim, K., Hong, K., Han, W.S.: G-care: a framework for performance benchmarking of cardinality estimation techniques for subgraph matching. In: International Conference on Management of Data (SIGMOD) (2020)
[24]
Pérez J, Arenas M, and Gutiérrez C Semantics and complexity of SPARQL ACM Trans. Database Syst. 2009 34 3 1-45
[25]
Schmidt, M., Meier, M., Lausen, G.: Foundations of SPARQL query optimization. In: Database Theory - ICDT 2010, pp. 4–33 (2010)
[26]
Selingerl, P., Astrahan, M., Chamberlin, D., Lorie, R., Price, T.: Access path selection in a relational database management system. In: ACM SIGMOD (1979)
[27]
Sengupta, N., Bagchi, A., Ramanath, M., Bedathur, S.: Arrow: approximating reachability using random walks over web-scale graphs. In: International Conference on Data Engineering (ICDE), pp. 470–481. IEEE (2019)
[28]
Seufert, S., Anand, A., Bedathur, S., Weikum, G.: Ferrari: flexible and efficient reachability range assignment for graph indexing. In: 29th International Conference on Data Engineering (ICDE), pp. 1009–1020. IEEE (2013)
[29]
Stefanoni, G., Motik, B., Kostylev, E.V.: Estimating the cardinality of conjunctive queries over RDF data using graph summarisation. In: The World Wide Web Conference, pp. 1043–1052 (2018)
[30]
Steve, H., Andy, S.: SPARQL 1.1 query language. In: Recommendation W3C (2013)
[31]
Thompson, B., Personick, M., Cutcher, M.: The bigdata® RDF graph database. In: Linked Data Management, pp. 221–266. Chapman and Hall/CRC, Boca Raton (2016)
[32]
Wadhwa, S., Prasad, A., Ranu, S., Bagchi, A., Bedathur, S.: Efficiently answering regular simple path queries on large labeled networks. In: International Conference on Management of Data, pp. 1463–1480 (2019)
[33]
Yakovets, N., Godfrey, P., Gryz, J.: Query planning for evaluating SPARQL property paths. In: International Conference on Management of Data, pp. 1875–1889 (2016)
Recommendations
Coral: federated query join order optimization based on deep reinforcement learning
AbstractThe rise of diversified data engines has created the need for federated queries. A federated query can take a query and provide data analysis based on data from various data engines. Since the query data originates from multiple data engines, ...
Rewriting queries on SPARQL views
WWW '11: Proceedings of the 20th international conference on World wide webThe problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, or when integrating RDF data from disparate sources. We approach this ...
Containment of Expressive SPARQL Navigational Queries
The Semantic Web – ISWC 2016AbstractQuery containment is one of the building block of query optimization techniques. In the relational world, query containment is a well-studied problem. At the same time it is well-understood that relational queries are not enough to cope with graph-...
Comments
Information & Contributors
Information
Published In
May 2023
741 pages
ISBN:978-3-031-33454-2
DOI:10.1007/978-3-031-33455-9
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 28 May 2023
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Aug 2024
Other Metrics
Citations
Cited By
View all- 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
View Options
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.
Sign in