The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Semantics and Complexity of SPARQL
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Resource Description Framework (RDF): Concepts and Abstract Syntax
Klyne, G., & Carroll, J. J. (2004) · Cited by 1,927
The complexity of relational query languages (Extended Abstract)
Vardi, M. Y. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802186 · Cited by 1,184
Foundations of semantic web databases
Gutierrez, C., Hurtado, C., & Mendelzon, A. O. (2004) · Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1055558.1055573 · Cited by 281
Self-citationA Comparison of RDF Query Languages
Haase, P., Broekstra, J., Eberhart, A., & Volz, R. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30475-3_35 · Cited by 203
RAL: an algebra for querying RDF
Frăsincar, F., Houben, G., Vdovjak, R., & Barna, P. (2003) · International Conference on Web Information Systems Engineering (WISE) · doi:10.1109/wise.2002.1181654 · Cited by 32
Cited by
A Proposal for Postpartum Support Based on Natural Language Generation Model
Zeni Montenegro, J. L., André Da Costa, C., Da Rosa Righi, R., Roehrs, A., & Farias, E. R. (2018) · 2018 International Conference on Computational Science and Computational Intelligence (CSCI) · doi:10.1109/csci46756.2018.00151 · Cited by 6
Metadata
- Authors
- Pérez, J., Arenas, M., & Gutierrez, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 30-43
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1560159331
- Cited by
- 379
- References
- 5
- FWCI
- 23.29
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Semantics and Complexity of SPARQL. https://app.cochat.ai/papers/10.1007/11926078_3
- The paper
- Pérez, J., Arenas, M., & Gutierrez, C. (2006). Semantics and Complexity of SPARQL. Lecture Notes in Computer Science. https://doi.org/10.1007/11926078_3
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
