BIROn - Birkbeck Institutional Research Online

Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies

Levene, Mark and Loizou, George (2001) Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies. Theoretical Computer Science 254 (1-2), pp. 683-690. ISSN 0304-3975.

[img]
Preview
Text
levene3.pdf

Download (125Kb) | Preview
Official URL: http://dx.doi.org/10.1016/S0304-3975(00)00394-7

Abstract

Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. A given set of FDs does not interact with a given set of INDs if logical implication of any FD can be determined solely by the given set of FDs, and logical implication of any IND can be determined solely by the given set of INDs. The set of tree-like INDs constitutes a useful subclass of INDs whose implication problem is polynomial time decidable. We exhibit a necessary and sufficient condition for a set of FDs and tree-like INDs not to interact; this condition can be tested in polynomial time.

Item Type: Article
Keyword(s) / Subject(s): Relation, Database, Logical implication, Functional dependency, Inclusion dependency
School or Research Centre: Birkbeck Schools and Research Centres > School of Business, Economics & Informatics > Computer Science and Information Systems
Depositing User: Administrator
Date Deposited: 09 Aug 2005
Last Modified: 17 Apr 2013 12:32
URI: http://eprints.bbk.ac.uk/id/eprint/194

Archive Staff Only (login required)

Edit/View Item Edit/View Item