Querying conceptual schemata with expressive equality constraints
Calì, Andrea and Gottlob, G. and Pieris, A. (2011) Querying conceptual schemata with expressive equality constraints. In: Jeusfeld, M. and Delcambre, L. and Ling, T.-W. (eds.) Conceptual Modeling: ER 2011. Lecture Notes in Computer Science 6998. Berlin, Germany: Springer, pp. 161-174. ISBN 9783642246050.
Abstract
When querying data through a conceptual schema or ontology, we compute answers entailed by the logical theory constituted by the data plus the conceptual schema. Traditional database constraints like tuple-generating dependencies (TGDs) and equality-generating dependencies (EGDs) are a useful tool for ontology specification. However, their interaction leads to undecidability of query answering even in simple cases. In this paper we exhibit a novel and general class of EGDs that, together with a relevant class of TGDs, ensures decidability of query answering. Our results capture well-known ontology languages as special cases; in particular, they allow us to deal with extended Entity-Relationship schemata enriched with expressive equality constraints.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | Proceedings, 30th International Conference, ER 2011, Brussels, Belgium, October 31 - November 3. |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Birkbeck Knowledge Lab |
| Depositing User: | Sarah Hall |
| Date Deposited: | 26 Apr 2013 16:01 |
| Last Modified: | 09 Aug 2023 12:32 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/6499 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |