The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2011 vol.23)
pp: 638-639
Claudio Gutierrez , Universidad de Chile, Santiago
Jorge Pérez , Pontificia Universidad Católica de Chile, Santigo
In the paper, “semQA: SPARQL with Idempotent Disjunction” [4], the authors study the RDF query language SPARQL. In particular, they claim that some of the results presented in [1] are not correct. In this note, we refute the claims made in [4], and actually show that some of the formal results of [4] are incorrect.
RDF, query language, SPARQL, evaluation problem, combined complexity.
Claudio Gutierrez, Jorge Pérez, "Some Remarks on the Paper "semQA: SPARQL with Idempotent Disjunction”", IEEE Transactions on Knowledge & Data Engineering, vol.23, no. 4, pp. 638-639, April 2011, doi:10.1109/TKDE.2010.139
[1] J. Pérez, M. Arenas, and C. Gutierrez, "Semantics and Complexity of SPARQL," Proc. Fifth Int'l Semantic Web Conf., pp. 30-43, 2006.
[2] J. Pérez, M. Arenas, and C. Gutierrez, "Semantics and Complexity of SPARQL," ACM Trans. Database Systems, vol. 34, no. 3, pp. 16:1-16:45, 2009.
[3] M. Schmidt, M. Meier, and G. Lausen, "Foundations of SPARQL Query Optimization," Proc. 13th Int'l Conf. Database Theory, pp. 4-33, 2010.
[4] E.P. Shironoshita, Y.R. Jean-Mary, R.M. Bradley, and M.R. Kabuka, "semQA: SPARQL with Idempotent Disjunction," IEEE Trans. Knowledge and Data Eng. vol. 21, no. 3, pp. 401-414, Mar. 2009.
[5] M.Y. Vardi, "The Complexity of Relational Query Languages (Extended Abstract)," Proc. 14th Ann. ACM Symp. Theory of Computing, pp. 137-146, 1982.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool