Semantics and complexity of SPARQL

ACM Transactions on Database Systems

Volumn 34, Issue 3, 2009, Pages

  Pérez, Jorge ^a   Arenas, Marcelo ^a   Gutierrez, Claudio ^a  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

Author keywords

Complexity; Query language; RDF; Semantic Web; SPARQL

Indexed keywords

COMPLEXITY; COMPLEXITY RESULTS; COMPOSITIONAL SEMANTICS; CORE PART; EVALUATION PROBLEMS; GRAPH PATTERN MATCHING; LARGE CLASS; QUERY EVALUATION; RDF; RDF DATA; REWRITING RULES; SPARQL;

LINGUISTICS; PATTERN MATCHING; SEMANTIC WEB; SEMANTICS;

QUERY LANGUAGES;

EID: 70349088138     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1567274.1567278     Document Type: Article

References (36)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley.
2. ABITEBOUL, S., KANELLAKIS, P., AND GRAHNE, G. 1991. On the representation and querying of sets of possible worlds. Theor. Comput. Sci. 78, 1, 158-187.
3. ANGLES, R. AND GUTIERREZ, C. 2008. The expressive power of sparql. In Proceedings of the International Semantic Web Conference (ISWC), 114-129.
4. ARENAS, M., GUTIERREZ, C., PARSIA, B., ṔEREZ, J., POLLERES, A., AND SEABORNE, A. 2007. SPARQL-Where are we? Current state, theory and practice. Full day tutorial, European Semantic Web Conference.
5. ARQ, 2006. A SPARQL processor for Jena, version 1.3 March 2006, Hewlett-Packard Development Company. http://jena.sourceforge.net/ARQ.
6. BEERI, C., FAGIN, R., MAIER, D., AND YANNAKAKIS, M. 1983. On the desirability of acyclic database schemes. J. ACM 30, 3, 479-513.
7. BHARGAVA, G., GOEL, P., AND IYER, B. 1995. Hypergraph based reorderings of outer join queries with complex predicates. In Proceedings of the SIGMOD International Conference of Management of Data, 304-315.
8. CHANDRA, A. AND MERLIN, P. 1977. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of the Symposium on the Theory of Computing (STOC), 77-90.
9. CHEN, L., GUPTA, A., AND KURUL, E. 2005. A semantic-aware RDF query algebra. In Proceedings of the International Conference on Management of Data (COMAD).
10. CYGANIAK, R. 2005. A relational algebra for sparql. Tech. rep. HPL-2005-2170, HP-Labs. http://www.hpl.hp.com/techreports/2005/HPL-2005-170. html.
11. DE BRUIJN, J., FRANCONI, E., AND TESSARIS, S. 2005. Logical reconstruction of normative RDF. In Proceedings of the OWL-Experiences and Directions Workshop (OWLED).
12. DURST, M. AND SUIGNARD, M. 2005. Rfc 3987, internationalized resource identifiers (IRIS). http://www.ietf.org/rfc/rfc3987.txt.
13. FRASINCAR, F., HOUBEN, G.-J., VDOVJAK, R., AND BARNA, P. 2004. RAL: An algebra for querying RDF. World Wide Web 7, 1, 83-109.
14. FURCHE, T., LINSE, B., BRY, F., PLEXOUSAKIS, D., AND GOTTLOB, G. 2006. RDF querying: Language constructs and evaluation methods compared. In Reasoning Web, 1-52.
15. GALINDO-LEGARIA, C. A. AND ROSENTHAL, A. 1997. Outerjoin simplification and reordering for query optimization. ACM Trans. Datab. Syst. 22, 1, 43-73.
16. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
17. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2001. The complexity of acyclic conjunctive queries. J. ACM 48, 3, 431-498.
18. GUTIERREZ, C., HURTADO, C. A., AND MENDELZON, A. O. 2004. Foundations of semantic Web databases. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 95-106.
19. HAASE, P., BROEKSTRA, J., EBERHART, A., AND VOLZ, R. 2004. A comparison of RDF query languages. In Proceedings of the International Semantic Web Conference (ISWC), 502-517.
20. HARRIS, S. AND SHADBOLT, N. 2005. SPARQL query processing with conventional relational database systems. In Proceedings of the WISE Workshops, 235-244.
21. IMIELINSKI, T. AND LIPSKI, W. 1984. Incomplete information in relational databases. J. ACM 31, 4, 761-791.
22. KARVOUNARAKIS, G., ALEXAKI, S., CHRISTOPHIDES, V., PLEXOUSAKIS, D., AND SCHOLL, M. 2002. RQL: A declarative query language for RDF. In Proceedings of the International Conference on World Wide Web (WWW), 592-603.
23. KLYNE, G., CARROLL, J. J., ANDMCBRIDE, B. 2004. Resource description framework (RDF): Concepts and abstract syntax. W3C recommendation. http://www.w3.org/TR/rdf-concepts/.
24. MANOLA, F. AND MILLER, E. 2004. RDF primer, W3C recommendation. http://www.w3.org/TR/rdf-concepts/.
25. MARIN, D. 2004. Aformalization ofRDF(applications de la logique ́a la śemantique duWeb). Tech. rep., É cole Polytechnique, Universidad de Chile. Department of Computer Science, Universidad de Chile, TR/DCC-2006-2008
26. ṔEREZ, J., ARENAS, M., AND GUTIERREZ, C. 2006a. Semantics and complexity of SPARQL. In Proceedings of the International Semantic Web Conference (ISWC). 30-43.
27. ṔEREZ, J., ARENAS, M., AND GUTIERREZ, C. 2006b. Semantics of SPARQL. Tech. rep., Universidad de Chile. Department of Computer Science, Universidad de Chile, TR/DCC-2006-2017
28. POLLERES, A. 2007. From SPARQL to rules (and back). In Proceedings of the International Conference on World Wide Web (WWW), 787-796.
29. PRUD?HOMMEAUX, E. AND SEABORNE, A. 2008. SPARQL query language for RDF. W3C recommendation. http://www.w3.org/TR/rdf-sparql-query/.
30. ROBERTSON, E. L. 2004. Triadic relations: An algebra for the semantic Web. In Proceedings of the International Workshop on Semantic Web and Databases (SWDB), 91-108.
31. SCHMIDT, M., MEIER, M., AND LAUSEN, G. 2008. Foundations of SPARQL query optimization. http://arxiv.org/abs/0812.3788.
32. SEABORNE, A. 2006. Personal communication.
33. SERFIOTIS, G., KOFFINA, I., CHRISTOPHIDES, V., AND TANNEN, V. 2005. Containment and minimization of RDF/S query patterns. In Proceedings of the International Semantic Web Conference (ISWC), 607-623.
34. VARDI, M. Y. 1982. The complexity of relational query languages (extended abstract). In Proceedings of the Symposium on the Theory of Computing (STOC), 137-146.
35. YANNAKAKIS, M. 1981. Algorithms for acyclic database schemes. In Proceedings of the International Conference on Very Large Data Bases (VLDB), 82-94.
36. ZANIOLO, C. 1984. Database relations with null values. J. Comput. Syst. Sci. 28, 1, 142-166.