Abstract

We consider the problem of query containment under ontological constraints, such as those of RDFS. Query containment, i.e., deciding whether the answers of a given query are always contained in the answers of another query, is an important problem to areas such as database theory and knowledge representation, with applications to data integration, query optimization and minimization. We consider unions of conjunctive queries, which constitute the core of structured query languages, such as SPARQL and SQL. We also consider ontological constraints or axioms, expressed in the language of Tuple-Generating Dependencies. TGDs capture RDF/S and fragments of Description Logics. We consider classes of TGDs for which the chase is known to terminate. Query containment under chase-terminating axioms can be decided by first running the chase on one of the two queries and then rely on classic relational …

Metadata

publication

Proceedings of the Fifth Workshop on Semantic Web Information Management, 1-8, 2013

year

2013

publication date

2013/6/23

authors

George Konstantinidis, Jose Luis Ambite

link

https://dl.acm.org/doi/abs/10.1145/2484712.2484716

resource_link

https://www.southampton.ac.uk/~gk1e17/queryContainment.pdf

book

Proceedings of the Fifth Workshop on Semantic Web Information Management

pages

1-8