How to decide query containment under constraints using a description logic
Cached
Download Links
by
Ian Horrocks
,
Sergio Tessaris
,
Ulrike Sattler
,
Stephan Tobies
| Venue: | In Proc. of the 7th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR 2000), Lecture Notes in Artificial Intelligence |
| Citations: | 50 - 20 self |
BibTeX
@INPROCEEDINGS{Horrocks_howto,
author = {Ian Horrocks and Sergio Tessaris and Ulrike Sattler and Stephan Tobies},
title = {How to decide query containment under constraints using a description logic},
booktitle = {In Proc. of the 7th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR 2000), Lecture Notes in Artificial Intelligence},
year = {},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 (derived, for example, from a schema). This problem is of particular importance in information integration (see [7]) and data warehousing
