Abstract
Flexible querying techniques can be used to enhance users’ access to heterogeneous data sets, such as Linked Open Data. An extension of the SPARQL query language with flexible capabilities, called SPARQL\(^{AR}\), was defined in [2], where an evaluation algorithm based on query rewriting was presented. In this paper, we propose two optimisation techniques for evaluating SPARQL\(^{AR}\) queries. The first is based on a caching technique, in which we pre-compute some answers in advance. The second exploits a summarisation of the data graph being queried.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chekol, M.W., Euzenat, J., Genevès, P., Layaida, N.: PSPARQL query containment. Research report, Inria Grenoble Rhône-Alpes/LIG Laboratoire d’Informatique de Grenoble (2011)
Frosini, R., Calì, A., Poulovassilis, A., Wood, P.T.: Flexible query processing for SPARQL. Semant. Web 8(4), 533–563 (2017)
Poulovassilis, A., Wood, P.T.: Combining approximation and relaxation in semantic web path queries. In: Patel-Schneider, P.F., Pan, Y., Hitzler, P., Mika, P., Zhang, L., Pan, J.Z., Horrocks, I., Glimm, B. (eds.) ISWC 2010. LNCS, vol. 6496, pp. 631–646. Springer, Heidelberg (2010). doi:10.1007/978-3-642-17746-0_40
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Frosini, R. (2017). Optimisation Techniques for Flexible Querying in SPARQL 1.1. In: Calì, A., Wood, P., Martin, N., Poulovassilis, A. (eds) Data Analytics. BICOD 2017. Lecture Notes in Computer Science(), vol 10365. Springer, Cham. https://doi.org/10.1007/978-3-319-60795-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-60795-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60794-8
Online ISBN: 978-3-319-60795-5
eBook Packages: Computer ScienceComputer Science (R0)