Abstract
Triple Pattern Fragments (TPFs) allow for querying large RDF graphs with high availability by offering triple pattern-based access to the graphs. The limited expressivity of TPFs leads to higher client-side querying and communication costs with potentially many intermediate results that need to be transferred. Thus, the challenge of devising efficient query plans when evaluating SPARQL queries lies in minimizing these costs. Different heuristics and cost-based query planning approaches have been proposed to obtain such efficient query plans. However, we also require means to visualize, manually modify, and execute alternative query plans, to better understand the differences between existing planning approaches and their potential limitations. To this end, we propose Slurp (https://people.aifb.kit.edu/zg2916/slurp/), an interactive SPARQL query planner that assists RDF data consumers to visualize, modify, and compare the performance of different query execution plans over TPFs.
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
References
Acosta, M., Vidal, M.-E.: Networks of linked data eddies: an adaptive web query processing engine for RDF data. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9366, pp. 111–127. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25007-6_7
Gawade, M., Kersten, M.L.: Stethoscope: a platform for interactive visual analysis of query execution plans. Proc. VLDB Endow. 5(12), 1926–1929 (2012)
Heling, L., Acosta, M.: Cost-and robustness-based query optimization for linked data fragments. In: Pan, J.Z., et al. (eds.) ISWC 2020. LNCS, vol. 12506, pp. 238–257. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-62419-4_14
Jakobsen, A.L., Montoya, G., Hose, K.: How diverse are federated query execution plans really? In: Hitzler, P., et al. (eds.) ESWC 2019. LNCS, vol. 11762, pp. 105–110. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-32327-1_21
Taelman, R., Van Herwegen, J., Vander Sande, M., Verborgh, R.: Comunica: a modular SPARQL query engine for the web. In: Vrandečić, D., et al. (eds.) ISWC 2018. LNCS, vol. 11137, pp. 239–255. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00668-6_15
Verborgh, R., et al.: Triple pattern fragments: a low-cost knowledge graph interface for the web. J. Web Semant. 37–38, 184–206 (2016)
Acknowledgement
This work was supported by the grant QUOCA (FKZ 01IS17042) from the German Federal Ministry of Education and Research (BMBF).
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
Dresselhaus, J., Filippov, I., Gengenbach, J., Heling, L., Käfer, T. (2021). SLURP: An Interactive SPARQL Query Planner. In: Verborgh, R., et al. The Semantic Web: ESWC 2021 Satellite Events. ESWC 2021. Lecture Notes in Computer Science(), vol 12739. Springer, Cham. https://doi.org/10.1007/978-3-030-80418-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-80418-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-80417-6
Online ISBN: 978-3-030-80418-3
eBook Packages: Computer ScienceComputer Science (R0)