Issue No. 03 - March (2009 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.91
E. Patrick Shironoshita , INFOTECH Soft, Inc., Miami
Yves R. Jean-Mary , INFOTECH Soft, Inc., Miami
Ray M. Bradley , INFOTECH Soft, Inc., Miami
Mansur R. Kabuka , INFOTECH Soft, Inc., Miami and University of Miami, Coral Gables
The SPARQL LeftJoin abstract operator is not distributive over Union; this limits the algebraic manipulation of graph patterns, which in turn restricts the ability to create query plans for distributed processing or query optimization. In this paper, we present semQA, an algebraic extension for the SPARQL query language for RDF, which overcomes this issue by transforming graph patterns through the use of an idempotent disjunction operator Or as a substitute for Union. This permits the application of a set of equivalences that transform a query into distinct forms. We further present an algorithm to derive the solution set of the original query from the solution set of a query where Union has been substituted by Or. We also analyze the combined complexity of SPARQL, proving it to be NP-complete. It is also shown that the SPARQL query language is not, in the general case, fixed-parameter tractable. Experimental results are presented to validate the query evaluation methodology presented in this paper against the SPARQL standard, to corroborate the complexity analysis, and to illustrate the gains in processing cost reduction that can be obtained through the application of semQA.
Query processing, Query languages, Ontology
E. P. Shironoshita, M. R. Kabuka, Y. R. Jean-Mary and R. M. Bradley, "semQA: SPARQL with Idempotent Disjunction," in IEEE Transactions on Knowledge & Data Engineering, vol. 21, no. , pp. 401-414, 2008.