DocumentCode :
1299552
Title :
Some Remarks on the Paper "semQA: SPARQL with Idempotent Disjunction”
Author :
Arenas, Marcelo ; Gutierrez, Claudio ; Pérez, Jorge
Author_Institution :
Dept. of Comput. Sci., Pontificia Univ. Catolica de Chile, Santiago, Chile
Volume :
23
Issue :
4
fYear :
2011
fDate :
4/1/2011 12:00:00 AM
Firstpage :
638
Lastpage :
639
Abstract :
In the paper, “semQA: SPARQL with Idempotent Disjunction”, the authors study the RDF query language SPARQL. In particular, they claim that some of the results presented in are not correct. In this note, we refute the claims made in, and actually show that some of the formal results of are incorrect.
Keywords :
computational complexity; query languages; RDF query language; SPARQL query language; idempotent disjunction; resource description language; RDF; SPARQL; combined complexity.; evaluation problem; query language;
fLanguage :
English
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
1041-4347
Type :
jour
DOI :
10.1109/TKDE.2010.139
Filename :
5551138
Link To Document :
بازگشت