SemQA

SPARQL with idempotent disjunction

E. Patrick Shironoshita, Yves R. Jean-Mary, Ray M. Bradley, Mansur R. Kabuka

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)401-414
Number of pages14
JournalIEEE Transactions on Knowledge and Data Engineering
Volume21
Issue number3
DOIs
StatePublished - Mar 1 2009

Fingerprint

Query languages
Processing
Cost reduction

Keywords

  • Ontology languages
  • Query languages
  • Query processing

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Computer Science Applications

Cite this

SemQA : SPARQL with idempotent disjunction. / Shironoshita, E. Patrick; Jean-Mary, Yves R.; Bradley, Ray M.; Kabuka, Mansur R.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 21, No. 3, 01.03.2009, p. 401-414.

Research output: Contribution to journalArticle

Shironoshita, E. Patrick ; Jean-Mary, Yves R. ; Bradley, Ray M. ; Kabuka, Mansur R. / SemQA : SPARQL with idempotent disjunction. In: IEEE Transactions on Knowledge and Data Engineering. 2009 ; Vol. 21, No. 3. pp. 401-414.
@article{dd569ffd206e44a1987110fa58b69e77,
title = "SemQA: SPARQL with idempotent disjunction",
abstract = "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.",
keywords = "Ontology languages, Query languages, Query processing",
author = "Shironoshita, {E. Patrick} and Jean-Mary, {Yves R.} and Bradley, {Ray M.} and Kabuka, {Mansur R.}",
year = "2009",
month = "3",
day = "1",
doi = "10.1109/TKDE.2008.91",
language = "English",
volume = "21",
pages = "401--414",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "3",

}

TY - JOUR

T1 - SemQA

T2 - SPARQL with idempotent disjunction

AU - Shironoshita, E. Patrick

AU - Jean-Mary, Yves R.

AU - Bradley, Ray M.

AU - Kabuka, Mansur R.

PY - 2009/3/1

Y1 - 2009/3/1

N2 - 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.

AB - 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.

KW - Ontology languages

KW - Query languages

KW - Query processing

UR - http://www.scopus.com/inward/record.url?scp=70350448598&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350448598&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2008.91

DO - 10.1109/TKDE.2008.91

M3 - Article

VL - 21

SP - 401

EP - 414

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 3

ER -