Please use this identifier to cite or link to this item:
|Title:||Weakly independent database schemes|
|Authors:||Wang, K. |
|Source:||Wang, K.,Zhang, W.,Chau, S.-C. (1997-01). Weakly independent database schemes. Acta Informatica 34 (1) : 1-22. ScholarBank@NUS Repository.|
|Abstract:||Independent database schemes are best known to have constraints enforced globally by enforcing them locally in individual relations, and therefore are highly desirable in an updates-busy and distributed environment. However, independence excludes all database schemes with interrelational functional dependencies and therefore is too strong a condition. In this paper, a natural generalization of independent schemes along this line, called weakly independent schemes, is defined. A database scheme is weakly independent with respect to a set of embedded functional dependencies if the constraints can be enforced globally by enforcing local as well as interrelational functional dependencies. (a) A characterization of the weak independence and an exponential time test (in the number of functional dependencies) are presented. (b) Two polynomial time conditions are also presented, one is necessary and the other is sufficient for a database scheme to be weakly independent. (c) It is shown that a certain acyclicity of the database scheme implies weak independence. Extension to the case of embedded functional dependencies plus the joir dependency times sign closed R is also considered.|
|Source Title:||Acta Informatica|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 9, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.