ON THE IMPLICATION OF MULTIVALUED DEPENDENCIES IN PARTIAL DATABASE RELATIONS

2008 ◽  
Vol 19 (03) ◽  
pp. 691-715 ◽  
Author(s):  
SEBASTIAN LINK

The implication of multivalued dependencies (MVDs) in relational databases has originally and independently been defined in the context of some fixed finite universe by Delobel, Fagin, and Zaniolo. Biskup observed that the original axiomatisation for MVD implication does not reflect the fact that the complementation rule is merely a means to achieve database normalisation. He proposed two alternative ways to overcome this deficiency: i) an axiomatisation that does represent the role of the complementation rule adequately, and ii) a notion of MVD implication in which the underlying universe of attributes is left undetermined together with an axiomatisation of this notion. In this paper we investigate multivalued dependencies with null values (NMVDs) as defined and axiomatised by Lien. We show that Lien's axiomatisation does not adequately reflect the role of the complementation rule, and extend Biskup's findings for MVDs in total database relations to NMVDs in partial database relations. Moreover, a correspondence between (minimal) axiomatisations in fixed universes that do reflect the property of complementation and (minimal) axiomatisations in undetermined universes is shown.

1989 ◽  
Vol 26 (7) ◽  
pp. 615-642 ◽  
Author(s):  
Mark A. Roth ◽  
Henry F. Korth ◽  
Abraham Silberschatz

2002 ◽  
Vol 40 (1) ◽  
pp. 55-64
Author(s):  
Saran Akram Abd Al-Majeed

There has been a great deal of discussion about null values in relational databases. The relational model was defined in 1969, and Nulls Was died in 1979. Unfortunately, there is not a generally agreeable solution for rull values problem. Null is a special marker which stands for a value undefined or unknown, which means thut ne entry has been made, a missing valuc mark is not a value and not of a date type and cannot be treated as a value by Database Management System (DBMS). As we know, distributed database users are more than a single database and data will be distributed among several data sources or sites, it must be precise data, the replication is allowed there, so complex problems will appear, then there will be need for perfect practical general approaches for treatment of Nulls. A distributed database system is designed, that is "Hotel reservation control system, based on different data sources at four site, each site is represented as a Hotel, for more heterogeneity different application programming languages there are five practical approaches, designed with their rules and algorithms for Null values treatment through the distributed database sites. (1), (2), (3). 14). 15), (9).


2012 ◽  
Vol 12 (4-5) ◽  
pp. 565-582 ◽  
Author(s):  
VLADIMIR LIFSCHITZ ◽  
KARL PICHOTTA ◽  
FANGKAI YANG

AbstractGeneralized relational theories with null values in the sense of Reiter are first-order theories that provide a semantics for relational databases with incomplete information. In this paper we show that any such theory can be turned into an equivalent logic program, so that models of the theory can be generated using computational methods of answer set programming. As a step towards this goal, we develop a general method for calculating stable models under the domain closure assumption but without the unique name assumption.


Sign in / Sign up

Export Citation Format

Share Document