research-article

Containment and equivalence of well-designed SPARQL

Authors:

Reinhard Pichler,

Sebastian SkritekAuthors Info & Claims

PODS '14: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 39 - 50

https://doi.org/10.1145/2594538.2594542

Published: 18 June 2014 Publication History

Abstract

Query containment and query equivalence constitute important computational problems in the context of static query analysis and optimization. While these problems have been intensively studied for fragments of relational calculus, almost no works exist for the semantic web query language SPARQL. In this paper, we carry out a comprehensive complexity analysis of containment and equivalence for several fragments of SPARQL: we start with the fundamental fragment of well-designed SPARQL restricted to the AND and OPTIONAL operator. We then study basic extensions in the form of the UNION operator and/or projection. The results obtained range from NP-completeness to undecidability.

References

[1]

R. Angles and C. Gutierrez. The expressive power of SPARQL. In ISWC, volume 5318 of LNCS, pages 114--129. Springer, 2008.

Digital Library

[2]

M. Arenas and J. Pérez. Querying semantic web data with SPARQL. In PODS, pages 305--316. ACM, 2011.

Digital Library

[3]

A. Calı, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In KR, pages 70--80. AAAI Press, 2008.

[4]

A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, pages 77--90. ACM, 1977.

Digital Library

[5]

M. W. Chekol, J. Euzenat, P. Genevès, and N. Layaıda. SPARQL query containment under RDFS entailment regime. In IJCAR, volume 7364 of LNCS, pages 134--148. Springer, 2012.

Digital Library

[6]

M. W. Chekol, J. Euzenat, P. Genevès, and N. Layaıda. SPARQL query containment under SHI axioms. In AAAI. AAAI Press, 2012.

[7]

R. Cyganiak, D. Wood, and M. Lanthaler. RDF 1.1 concepts and abstract syntax. W3C Recommendation, W3C, Feb. 2014. http://www.w3.org/TR/rdf11-concepts.

[8]

S. Harris and A. Seaborne. SPARQL 1.1 Query Language. W3C Recommendation, W3C, Mar. 2013. http://www.w3.org/TR/sparql11-query.

[9]

D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. JCSS, 28(1):167--189, 1984.

[10]

G. Karvounarakis, A. Magkanaraki, S. Alexaki, V. Christophides, D. Plexousakis, M. Scholl, and K. Tolle. Querying the semantic web with RQL. Computer Networks, 42(5):617--640, 2003.

Digital Library

[11]

A. C. Klug. On conjunctive queries containing inequalities. J. ACM, 35(1):146--160, 1988.

Digital Library

[12]

A. Letelier, J. Pérez, R. Pichler, and S. Skritek. Static analysis and optimization of semantic web queries. In PODS, pages 89--100. ACM, 2012.

Digital Library

[13]

A. Letelier, J. Pérez, R. Pichler, and S. Skritek. Static analysis and optimization of semantic web queries. ACM Trans. Database Syst., 38(4):25, 2013.

Digital Library

[14]

J. Pérez, M. Arenas, and C. Gutierrez. Semantics and complexity of SPARQL. In ISWC, volume 4273 of LNCS, pages 30--43. Springer, 2006.

Digital Library

[15]

J. Pérez, M. Arenas, and C. Gutierrez. Semantics and complexity of SPARQL. ACM TODS, 34(3), 2009.

Digital Library

[16]

A. Polleres. From SPARQL to rules (and back). In WWW, pages 787--796. ACM, 2007.

Digital Library

[17]

E. Prud'hommeaux and A. Seaborne. SPARQL Query Language for RDF. W3C Recommendation, %W3C, Jan. 2008. http://www.w3.org/TR/rdf-sparql-query.

[18]

Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. J. ACM, 27(4):633--655, 1980.

Digital Library

[19]

M. Schmidt, M. Meier, and G. Lausen. Foundations of SPARQL query optimization. In ICDT, pages 4--33. ACM, 2010.

Digital Library

[20]

G. Serfiotis, I. Koffina, V. Christophides, and V. Tannen. Containment and minimization of RDF/S query patterns. In ISWC, volume 3729 of LNCS, pages 607--623. Springer, 2005.

Digital Library

Cited By

Spasić MVujošević Janičić M(2023)Solving the SPARQL query containment problem with SpeCSWeb Semantics: Science, Services and Agents on the World Wide Web10.1016/j.websem.2022.10077076:COnline publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1016/j.websem.2022.100770
Fujimoto HSuzuki NKwon Y(2023)Checking Pattern Query Containment Under Shape ExpressionSN Computer Science10.1007/s42979-023-02142-z4:6Online publication date: 12-Oct-2023
https://dl.acm.org/doi/10.1007/s42979-023-02142-z
Asprino LCeriani M(2023)How is Your Knowledge Graph Used: Content-Centric Analysis of SPARQL Query LogsThe Semantic Web – ISWC 202310.1007/978-3-031-47240-4_11(197-215)Online publication date: 6-Nov-2023
https://dl.acm.org/doi/10.1007/978-3-031-47240-4_11
Show More Cited By

Index Terms

Containment and equivalence of well-designed SPARQL
1. Information systems
  1. Data management systems
    1. Query languages

Recommendations

Static analysis and optimization of semantic web queries
Invited papers issue

Static analysis is a fundamental task in query optimization. In this article we study static analysis and optimization techniques for SPARQL, which is the standard language for querying Semantic Web data. Of particular interest for us is the optionality ...
Static analysis and optimization of semantic web queries
PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems

Static analysis is a fundamental task in query optimization. In this paper we study static analysis and optimization techniques for SPARQL, which is the standard language for querying Semantic Web data. Of particular interest for us is the optionality ...
RDF, Jena, SparQL and the 'Semantic Web'
SIGUCCS '09: Proceedings of the 37th annual ACM SIGUCCS fall conference: communication and collaboration

The Resource Description Format (RDF) is used to represent information modeled as a "graph": a set of individual objects, along with a set of connections among those objects. In that role, RDF is one of the pillars of the so-called Semantic Web. This ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '14: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

June 2014

300 pages

ISBN:9781450323758

DOI:10.1145/2594538

General Chair:
Richard Hull
IBM T.J. Watson Research Center, USA
,
Program Chair:
Martin Grohe
RWTH Aachen University, Germany

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 June 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

SIGMOD/PODS'14

Sponsor:

SIGMOD

SIGMOD/PODS'14: International Conference on Management of Data

June 22 - 27, 2014

Utah, Snowbird, USA

Acceptance Rates

PODS '14 Paper Acceptance Rate 22 of 67 submissions, 33%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
375
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Spasić MVujošević Janičić M(2023)Solving the SPARQL query containment problem with SpeCSWeb Semantics: Science, Services and Agents on the World Wide Web10.1016/j.websem.2022.10077076:COnline publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1016/j.websem.2022.100770
Fujimoto HSuzuki NKwon Y(2023)Checking Pattern Query Containment Under Shape ExpressionSN Computer Science10.1007/s42979-023-02142-z4:6Online publication date: 12-Oct-2023
https://dl.acm.org/doi/10.1007/s42979-023-02142-z
Asprino LCeriani M(2023)How is Your Knowledge Graph Used: Content-Centric Analysis of SPARQL Query LogsThe Semantic Web – ISWC 202310.1007/978-3-031-47240-4_11(197-215)Online publication date: 6-Nov-2023
https://dl.acm.org/doi/10.1007/978-3-031-47240-4_11
Salas JHogan A(2022)Semantics and canonicalisation of SPARQL 1.1Semantic Web10.3233/SW-21287113:5(829-893)Online publication date: 18-Aug-2022
https://doi.org/10.3233/SW-212871
Frosini RPoulovassilis AWood PCalí A(2022)Optimisation Techniques for Flexible SPARQL QueriesACM Transactions on the Web10.1145/353285516:4(1-44)Online publication date: 16-Nov-2022
https://dl.acm.org/doi/10.1145/3532855
Atre M(2022)The Case of SPARQL UNION, FILTER and DISTINCTProceedings of the ACM Web Conference 202210.1145/3485447.3511992(1882-1892)Online publication date: 25-Apr-2022
https://dl.acm.org/doi/10.1145/3485447.3511992
Mengel SSkritek S(2021)Characterizing Tractability of Simple Well-Designed Pattern Trees with ProjectionTheory of Computing Systems10.1007/s00224-020-10002-z65:1(3-41)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1007/s00224-020-10002-z
Shao PTao MZhou MWang T(2020)Ontology-Based Modeling and Semantic Query for Mobile Trajectory Data2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)10.1109/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00176(1183-1188)Online publication date: Dec-2020
https://doi.org/10.1109/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00176
Mailis TKotidis YNikolopoulos VKharlamov EHorrocks IIoannidis YBoncz PManegold SAilamaki ADeshpande AKraska T(2019)An Efficient Index for RDF Query ContainmentProceedings of the 2019 International Conference on Management of Data10.1145/3299869.3319864(1499-1516)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3299869.3319864
Barceló PKröll MPichler RSkritek S(2018)Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with ProjectionACM Transactions on Database Systems10.1145/323398343:2(1-44)Online publication date: 21-Aug-2018
https://dl.acm.org/doi/10.1145/3233983
Show More Cited By

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.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents