Complexity and expressive power of weakly well-designed SPARQL
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2024
- Type
- D - Journal article
- DOI
-
10.1007/s00224-017-9802-9
- Title of journal
- Theory of Computing Systems
- Article number
- -
- First page
- 772
- Volume
- 62
- Issue
- 4
- ISSN
- 1432-4350
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The conference version of this paper received the best paper award at ICDT�16, and was invited to a special issue of TOCS. SPARQL is the standard query language for RDF data and a key technology for the Semantic Web, widely adopted in academia and industry. Well-designed SPARQL is an important and extensively studied fragment of SPARQL that ensures good computational properties of query evaluation. Yet real-life SPARQL queries are often not well designed. This paper proposes and studies an extension of well-designed SPARQL that preserves its desirable computational properties while capturing the vast majority of non-well-designed queries used in practice.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -