Query Rewriting and Answering Under Constraints in Data Integration Systems
Abstract
In this paper we address the problem of query answering and rewriting in global-as-view data integration systems, when key and inclusion dependencies are expressed on the global integration schema. In the case of sound views, we provide sound and complete rewriting techniques for a maximal class of constraints for which decidability holds. Then, we introduce a semantics which is able to cope with violations of constraints, and present a sound and complete rewriting technique for the same decidable class of constraints. Finally, we consider the decision problem of query answering and give decidability and complexity results. 1
Cite
Text
Calì et al. "Query Rewriting and Answering Under Constraints in Data Integration Systems." International Joint Conference on Artificial Intelligence, 2003.Markdown
[Calì et al. "Query Rewriting and Answering Under Constraints in Data Integration Systems." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/cali2003ijcai-query/)BibTeX
@inproceedings{cali2003ijcai-query,
title = {{Query Rewriting and Answering Under Constraints in Data Integration Systems}},
author = {Calì, Andrea and Lembo, Domenico and Rosati, Riccardo},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {16-21},
url = {https://mlanthology.org/ijcai/2003/cali2003ijcai-query/}
}