Semantics and complexity of SPARQL

@article{Prez2009SemanticsAC,
  title={Semantics and complexity of SPARQL},
  author={J. P{\'e}rez and M. Arenas and C. Guti{\'e}rrez},
  journal={ACM Trans. Database Syst.},
  year={2009},
  volume={34},
  pages={16:1-16:45}
}
  • J. Pérez, M. Arenas, C. Gutiérrez
  • Published 2009
  • Computer Science
  • ACM Trans. Database Syst.
  • SPARQL is the standard language for querying RDF data. In this article, we address systematically the formal study of the database aspects of SPARQL, concentrating in its graph pattern matching facility. We provide a compositional semantics for the core part of SPARQL, and study the complexity of the evaluation of several fragments of the language. Among other complexity results, we show that the evaluation of general SPARQL patterns is PSPACE-complete. We identify a large class of SPARQL… CONTINUE READING

    Topics from this paper.

    A directional diffuse reverberation model for excavated tunnels in rock
    10
    Etiological risk factors for brachial plexus palsy
    27

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 73 REFERENCES
    Canonical Equational Proofs
    114
    Natural Sounding Artificial Reverberation
    239
    Improvements in a half degree atmosphere/land version of the CCSM
    197
    Gender-role conflict scale: College men's fear of femininity
    716
    Assembly Automation and Product Design
    278