|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 41 van 56 gevonden artikelen
| Titel: |
QUERYING WEAK INSTANCES UNDER EXTENSION CHASE SEMANTICS: A COMPLETE SOLUTION |
| Auteur: |
Laurent, D. Luong, V. Phan Spyratos, N. |
| Verschenen in: |
International journal of computer mathematics |
| Paginering: | Jaargang 80 (2003) nr. 5 pagina's 591-613 |
| Jaar: |
2003-05 |
| Inhoud: |
The problem of computing windows using relational expressions has been solved only in certain cases in which the chase semantics and the extension chase semantics of the database coincide. However, the general problem of computing windows under either chase semantics or extension chase semantics, but without restrictions, remained an open problem. In this paper we present a complete solution of the general problem, under extension chase semantics. Our solution is complete in the sense that it does not require any assumption on the database scheme or on the database state. It follows that our approach subsumes previous approaches, and we exhibit cases in which our approach correctly computes the windows, while previous approaches fail to do so. Moreover, the efficiency of our approach lies in the fact that it uses only those relation schemes and only those functional dependencies that are necessary in the computation of windows. The main technique employed by our approach is a least fixpoint construction using the notion of cover (a cover being a set of relation schemes satisfying certain properties). The proposed technique can be implemented using relational algebra plus recursion. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 41 van 56 gevonden artikelen
| << vorige | volgende >> |