Abstract
SPARQL property path queries provide a succinct way to write complex navigational queries over RDF knowledge graphs. However, the evaluation of these queries over online knowledge graphs such as DBPedia or Wikidata is often interrupted by quotas, returning no results or partial results. To ensure complete results, property path queries are evaluated client-side. Smart clients decompose property path queries into subqueries for which complete results are ensured. The granularity of the decomposition depends on the expressivity of the server. Whatever the decomposition, it could generate a high number of subqueries, a large data transfer, and finally delivers poor performance. In this paper, we extend a preemptable SPARQL server with a partial transitive closure operator (PTC) based on a depth limited search algorithm. We show that a smart client using the PTC operator is able to process SPARQL property path online and deliver complete results. Experimental results demonstrate that our approach outperforms existing smart client solutions in terms of HTTP calls, data transfer and query execution time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Q1 and Q2 are respectively executed at the public SPARQL endpoints of Wikidata and DBPedia, at August 5 2020.
- 2.
Iterative Deepening Depth-First Search (IDDFS) can also be used, but IDDFS re-traverse same nodes many times.
- 3.
- 4.
References
Aimonier-Davat, J., Skaf-Molli, H., Molli, P.: How to execute sparql property path queries online and get complete results? In: 4rth Workshop on Storing, Querying and Benchmarking the Web of Data (QuWeDa 2020) Workshop at ISWC2020 (2020)
Arenas, M., Conca, S., Pérez, J.: Counting beyond a yottabyte, or how sparql 1.1 property paths will prevent adoption of the standard. In: Proceedings of the 21st International Conference on World Wide Web, pp. 629–638 (2012)
Bagan, G., Bonifati, A., Ciucanu, R., Fletcher, G.H., Lemay, A., Advokaat, N.: gmark: schema-driven generation of graphs and queries. IEEE Trans. Knowl. Data Eng. 29(4), 856–869 (2016)
Bonifati, A., Fletcher, G., Voigt, H., Yakovets, N.: Querying graphs. Synth. Lect. Data Manag. 10(3), 1–184 (2018)
Bonifati, A., Martens, W., Timm, T.: Navigating the maze of wikidata query logs. In: The World Wide Web Conference, pp. 127–138 (2019)
Buil-Aranda, C., Hogan, A., Umbrich, J., Vandenbussche, P.Y.: Sparql web-querying infrastructure: ready for action? In: International Semantic Web Conference, pp. 277–293 (2013)
Grall, A., Minier, T., Skaf-Molli, H., Molli, P.: Processing sparql aggregate queries with web preemption. In: European Semantic Web Conference, pp. 235–251 (2020)
Hartig, O., Letter, I., Pérez, J.: A formal framework for comparing linked data fragments. In: International Semantic Web Conference, pp. 364–382 (2017)
Hasnain, A., Mehmood, Q., Zainab, S.S., Hogan, A.: Sportal: profiling the content of public sparql endpoints. Int. J. Semant. Web Inf. Syst. (IJSWIS) 12(3), 134–163 (2016)
Minier, T., Skaf-Molli, H., Molli, P.: Sage: Web preemption for public sparql query services. In: The World Wide Web Conference, pp. 1268–1278 (2019)
Polleres, A., Kamdar, M.R., Fernández, J.D., Tudorache, T., Musen, M.A.: A more decentralized vision for linked data. In: 2nd Workshop on Decentralizing the Semantic Web (DeSemWeb 2018) co-located with ISWC 2018 (2018)
Reutter, J.L., Soto, A., Vrgoč, D.: Recursion in sparql. In: International Semantic Web Conference, pp. 19–35 (2015)
Russell, S.J., Norvig, P.: Artificial Intelligence - A Modern Approach. Prentice Hall series in artificial intelligence, 2nd edn. Prentice Hall, Upper Saddle River (2003)
Steve, H., Andy, S.: SPARQL 1.1 query language. In: Recommendation W3C (2013). https://www.w3.org/TR/sparql11-query
Taelman, R., Van Herwegen, J., Vander Sande, M., Verborgh, R.: Comunica: a modular sparql query engine for the web. In: International Semantic Web Conference, pp. 239–255 (2018)
Udupa, A., Desai, A., Rajamani, S.: Depth bounded explicit-state model checking. In: International SPIN Workshop on Model Checking of Software, pp. 57–74 (2011)
Verborgh, R., et al.: Triple pattern fragments: a low-cost knowledge graph interface for the web. J. Web Semant. 37, 184–206 (2016)
Acknowledgments
This work is supported by the ANR DeKaloG (Decentralized Knowledge Graphs) project, ANR-19-CE23-0014, CE23 - Intelligence artificielle.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Aimonier-Davat, J., Skaf-Molli, H., Molli, P. (2021). Processing SPARQL Property Path Queries Online with Web Preemption. In: Verborgh, R., et al. The Semantic Web. ESWC 2021. Lecture Notes in Computer Science(), vol 12731. Springer, Cham. https://doi.org/10.1007/978-3-030-77385-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-77385-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-77384-7
Online ISBN: 978-3-030-77385-4
eBook Packages: Computer ScienceComputer Science (R0)