Abstract
Resource Description Framework datasets can be queried using the SPARQL language but are often irregularly structured and incomplete, which may make precise query formulation hard for users. The SPARQLAR language extends SPARQL 1.1 with two operators—APPROX and RELAX—to allow flexible querying over property paths. These operators encapsulate different dimensions of query flexibility, namely, approximation and generalisation, and they allow users to query complex, heterogeneous knowledge graphs without needing to know precisely how the data is structured. Earlier work has described the syntax, semantics, and complexity of SPARQLAR, has demonstrated its practical feasibility, but has also highlighted the need for improving the speed of query evaluation. In the present article, we focus on the design of two optimisation techniques targeted at speeding up the execution of SPARQLAR queries and on their empirical evaluation on three knowledge graphs: LUBM, DBpedia, and YAGO. We show that applying these optimisations can result in substantial improvements in the execution times of longer-running queries (sometimes by one or more orders of magnitude) without incurring significant performance penalties for fast queries.
- [1] . 2009. Extending SPARQL with regular expression patterns (for querying RDF). Web Semant. 7, 2 (
Apr. 2009), 57–73. Google ScholarDigital Library
- [2] . 2014. Fuzzy XPath queries in XQuery. In Proceedings of the OTM (2014). 457–472.Google Scholar
Cross Ref
- [3] . 2004. FleXPath: Flexible structure and full-text querying for XML. In Proceedings of the ACM SIGMOD 2004. 83–94.Google Scholar
Digital Library
- [4] . 2008. The expressive power of SPARQL. In Proceedings of the ISWC. Springer-Verlag, Berlin, 114–129. Google Scholar
Digital Library
- [5] . 2003. Dynamic sample selection for approximate query processing. In Proceedings of the ACM SIGMOD 2003. 539–550.Google Scholar
Digital Library
- [6] . 2007. How to publish Linked Data on the Web. Retrieved from http://www4.wiwiss.fu-berlin.de/bizer/pub/LinkedDataTutorial/.Google Scholar
- [7] . 2021. FLUID: A common model for semantic structural graph summaries based on equivalence relations. Theoret. Comput. Sci. 854 (2021), 136–158.Google Scholar
Cross Ref
- [8] . 2008. Customizable flexible querying in classical relational databases. In Handbook of Research on Fuzzy Information Processing in Databases. IGI Global, 191–217.Google Scholar
Cross Ref
- [9] . 2009. Incremental controlled relaxation of failing flexible queries. J. Intell. Info. Syst. 33, 3 (2009), 261–283.Google Scholar
Digital Library
- [10] . 1992. Some approaches for relational databases flexible querying. J. Intell. Info. Syst. 1, 3 (1992), 323–354.Google Scholar
Cross Ref
- [11] . 2008. Ranking for approximated XQuery full-text queries. In Proceedings of the BNCOD. 165–176.Google Scholar
Digital Library
- [12] . 2014. Flexible querying for SPARQL. In Proceedings of the OTM Confederated International Conferences: CoopIS and ODBASE. 473–490. Google Scholar
Cross Ref
- [13] . 2000. Containment of conjunctive regular path queries with inverse. In Proceedings of the KR. 176–185.Google Scholar
- [14] . 2003. Reasoning on regular path queries. SIGMOD Rec. 32, 4 (
Dec. 2003), 83–92. Google ScholarDigital Library
- [15] . 2019. Summarizing semantic graphs: A survey. VLDB J. 28, 3 (
June 2019), 295–327.Google ScholarDigital Library
- [16] . 2011. R2DF framework for ranked path queries over weighted RDF graphs. In Proceedings of the WIMS. 1–12.Google Scholar
Digital Library
- [17] . 2001. Approximate query processing using wavelets. VLDB J. 10, 2–3 (2001), 199–223.Google Scholar
Digital Library
- [18] . 1996. CoBase: A scalable and extensible cooperative information system. J. Intell. Info. Syst. 6, 2/3 (1996), 223–259.Google Scholar
Digital Library
- [19] . 2013. A similarity measure for approximate querying over RDF data. In Proceedings of the EDBT/ICDT. 205–213.Google Scholar
Digital Library
- [20] . 2015. A unified framework for flexible query answering over heterogeneous data sources. In Proceedings of the FQAS. 283–294.Google Scholar
- [21] . 2009. Relaxing RDF queries based on user and domain preferences. J. Intell. Info. Syst. 33, 3 (2009), 239–260.Google Scholar
Digital Library
- [22] . 2011. Query relaxation for entity-relationship search. In Proceedings of the ESWC. 62–76.Google Scholar
Cross Ref
- [23] . 2020. Containment of simple conjunctive regular path queries. In Proceedings of the KR. 371–380.Google Scholar
Cross Ref
- [24] . 2011. On the optimal approximation of queries using tractable propositional languages. In Proceedings of the ICDT’11. 174–185.Google Scholar
Digital Library
- [25] . 2019. Approximate querying for the property graph language cypher. In Proceedings of the IEEE BigData. IEEE, 617–622.Google Scholar
Cross Ref
- [26] . 1998. Query containment for conjunctive queries with regular expressions. In Proceedings of the
PODS . ACM, New York, NY, 139–148. Google ScholarDigital Library
- [27] . 2017. Flexible Query Processing of SPARQL Queries.
PhD Thesis. Google Scholar - [28] . 2017. Flexible query processing for SPARQL. Semantic Web 8, 4 (2017), 533–563.Google Scholar
Digital Library
- [29] . 1998. A server for fuzzy SQL queries. In Proceedings of the FQAS. 164–174.Google Scholar
Cross Ref
- [30] . 2006. Regular path queries under approximate semantics. Ann. Math. Artif. Intell. 46, 1–2 (2006), 165–190.Google Scholar
Digital Library
- [31] . 2013. SPARQL 1.1 Query Language.
W3C Recommendation. Google Scholar - [32] . 2008. Generalized selection via interactive query relaxation. In Proceedings of the CHI. 959–968.Google Scholar
Digital Library
- [33] . 2010. Toward ontology-guided knowledge-driven XML query relaxation. In Proceedings of the CIMSiM. 448–453.Google Scholar
Digital Library
- [34] . 2012. Towards fuzzy query relaxation for RDF. In Proceedings of the ISWC. 687–702.Google Scholar
Digital Library
- [35] . 2010. Query relaxation for star queries on RDF. In Proceedings of the WISE. 376–389.Google Scholar
Digital Library
- [36] . 2008. Computing relaxed answers on RDF databases. In Proceedings of the WISE. 163–175.Google Scholar
Digital Library
- [37] . 2008. Query relaxation in RDF. J. Data Semant. X (2008), 31–61.Google Scholar
Digital Library
- [38] . 2009. Ranking approximate answers to semantic web queries. In Proceedings of the ESWC. 263–277.Google Scholar
Digital Library
- [39] . 1999. Histogram-based approximation of set-valued query-answers. In Proceedings of the VLDB. 174–185.Google Scholar
- [40] . 2002. Exploiting local similarity for indexing paths in graph-structured data. In Proceedings of the 18th ICDE. 129–140.Google Scholar
Cross Ref
- [41] . 2021. A survey on semantic schema discovery. VLDB J. (2021), 1–36.Google Scholar
- [42] . 2007. The fundamentals of iSPARQL: A virtual triple approach for similarity-based semantic web tasks. In Proceedings of the ISWC. 295–309.Google Scholar
Digital Library
- [43] . 2015. SPARQL with property paths. In Proceedings of the ISWC (Lecture Notes in Computer Science), et al. (Eds.), Vol. 9366. Springer, 3–18.Google Scholar
Digital Library
- [44] . 2010. Adaptive relaxation for querying heterogeneous XML data sources. Info. Syst. 35, 6 (2010), 688–707.Google Scholar
Digital Library
- [45] . 2018. Graph summarization methods and applications: A survey. ACM Comput. Surv. 51, 3, Article
62 (June 2018), 34 pages. Google ScholarDigital Library
- [46] . 2019. An efficient index for RDF query containment. In Proceedings of the ICMD. ACM, New York, NY, 1499–1516.Google Scholar
Digital Library
- [47] . 2009. Flexible query answering on graph-modeled data. In Proceedings of the EDBT. 216–227.Google Scholar
Digital Library
- [48] . 2008. Providing flexible queries over web databases. In Knowledge-Based Intelligent Information and Engineering Systems. Springer, 601–606.Google Scholar
- [49] . 2007. Factor automata of automata and applications. In Implementation and Application of Automata, and (Eds.). Springer, Berlin, 168–179.Google Scholar
Cross Ref
- [50] . 2007. Minimal deductive systems for RDF. In Proceedings of the
ESWC . Springer-Verlag, Berlin, 53–67. Google ScholarDigital Library
- [51] . 1996. A process of fuzzy query on new fuzzy object oriented data model. In Proceedings of the DEXA. 500–509.Google Scholar
Cross Ref
- [52] . 2009. Semantics and complexity of SPARQL. ACM Trans. Database Syst. 34, 3, Article
16 (Sept. 2009), 45 pages. Google ScholarDigital Library
- [53] . 2014. Containment and equivalence of well-designed SPARQL. In Proceedings of the ACM SIGMOD-SIGACT-SIGART. 39–50.Google Scholar
Digital Library
- [54] . 2016. SPARQL extensions with preferences: A survey. In Proceedings of the SIGAPP. 1015–1020.Google Scholar
Digital Library
- [55] . 2016. Approximation and relaxation of semantic web path queries. J. Web Semant. 40 (2016), 1–21.Google Scholar
Digital Library
- [56] . 2010. Combining approximation and relaxation in semantic web path queries. In Proceedings of the ISWC. 631–646.Google Scholar
Cross Ref
- [57] . 2010. Efficient approximate SPARQL querying of web of linked data. In Proceedings of the URSW. 37–48.Google Scholar
- [58] . 2009. Foundations of SPARQL Query Optimization. Ph.D. Dissertation. Albert-Ludwigs-Universitat Freiburg. Retrieved from http://www.informatik.uni-freiburg.de/mschmidt/docs/diss_final01122010.pdf.Google Scholar
- [59] . 2005. An efficient and versatile query engine for TopX search. In Proceedings of the VLDB. 625–636.Google Scholar
- [60] . 2014. Schemaless and structureless graph querying. Proc. VLDB Endow. 7, 7 (2014), 565–576.Google Scholar
Digital Library
- [61] . 2016. Semantic SPARQL similarity search over RDF knowledge graphs. Proc. VLDB 9, 11 (2016), 840–851.Google Scholar
Digital Library
- [62] . 2007. Query relaxation using malleable schemas. In Proceedings of the ACM SIGMOD. 545–556.Google Scholar
Digital Library
Index Terms
Optimisation Techniques for Flexible SPARQL Queries
Recommendations
Flexible query processing for SPARQL
Question answering over Linked DataFlexible querying techniques can enhance users’ access to complex, heterogeneous datasets in settings such as Linked Data, where the user may not always know how a query should be formulated in order to retrieve the desired answers. This paper presents ...
Determinacy and query rewriting for conjunctive queries and views
Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. Constructing rewritings is a widely studied technique to derive those answers. In this paper we consider ...
Federating queries in SPARQL 1.1: Syntax, semantics and evaluation
Given the sustained growth that we are experiencing in the number of SPARQL endpoints available, the need to be able to send federated SPARQL queries across these has also grown. To address this use case, the W3C SPARQL working group is defining a ...






Comments