Levene, Mark and Loizou, G. (1995) The additivity problem for data dependencies in incomplete relational databases. In: Libkin, L. and Thalheim, B. (eds.) Semantics in Databases: Selected Papers from a Workshop. Lecture Notes in Computer Science 1358. Springer, pp. 136-169. ISBN 9783540641995.
Abstract
Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. We introduce null functional dependencies (NFDs) and null inclusion dependencies (NINDs) to cater for the situation when a database is incomplete and thus contains null values. If a NFD or NIND is weakly satisfied in a database, then there exists a possible world of this database in which the NFD or NIND is satisfied in the standard way. Additivity is the property of the equivalence of the weak satisfaction of a set of NFDs and NINDs, ε, with the individual weak satisfaction of each member of ε in the said database. We show that in general satisfaction of NFDs and NINDs is not additive. The problem that arises is: under what conditions is weak satisfaction of NFDs and NINDs additive. We solve this problem for the following cases: when E is a set of NFDs, when E is a set of unary NINDs and when E is a set of NFDs and unary NINDs. We show that, when the set of NINDs is unary, checking whether E is additive can be done in time polynomial in the size of E.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 08 Jun 2021 11:19 |
| Last Modified: | 09 Aug 2023 12:51 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/44659 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
