How to decide Query Containment under Constraints using a Description Logic

Ian HorrocksIan Horrocks, Ulrike SattlerUlrike Sattler, Sergio TessarisSergio Tessaris, Stephan TobiesStephan Tobies

Datei:HorSatTesTob-KRDB-2000.ps.gz

Download

Ian Horrocks, Ulrike Sattler, Sergio Tessaris, Stephan Tobies
How to decide Query Containment under Constraints using a Description Logic
Proceedings of the 7th International Workshop on Knowledge Representation meets Databases (KRDB-2000), 2000

Details
Bibtex

KurzfassungAbstract
Query containment under constraints is the problem of determining whether the result of one query is contained in the result of another query for every database satisfying a given set of constraints. This problem is of particular importance in information integration and warehousing where, in addition to the constraints derived from the source schemas and the global schema, inter-schema constraints can be used to specify relationships between objects in different schemas. A theoretical framework for tackling this problem using the DLR logic has been established, and in this paper we show how the framework can be extended to a practical decision procedure. The proposed technique is to extend DLR with an Abox (a set of assertions about named individuals and tuples), and to transform query subsumption problems into DLR Abox satisfiability problems. We then show how such problems can be decided, via a reification transformation, using a highly optimised reasoner for the SHIQ description logic.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

@inproceedings{ HorSatTesTob-KRDB-2000,
  author = {I. {Horrocks} and U. {Sattler} and S. {Tessaris} and S. {Tobies}},
  booktitle = {Proceedings of the 7th International Workshop on Knowledge Representation meets Databases {(KRDB-2000)}},
  title = {How to decide Query Containment under Constraints using a Description Logic},
  year = {2000},
}