CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Some results on the deductive structure of join dependencies

Peter Dybjer (Institutionen för informationsbehandling)
Theoretical Computer Science (0304-3975). Vol. 33 (1984), 1, p. 95-105.
[Artikel, refereegranskad vetenskaplig]

Among the many different data dependencies defined, the so-called join dependencies play a central role, since they explicitly capture lossless join properties for relation schemes. In this paper we state some inference rules for join dependencies and embedded join dependencies. A set of two rules is shown to be complete for monadic join dependency inferences (inferences from a single dependency). Furthermore, it is shown that there is no finite set of inference rules that is complete for embedded join dependencies.

Denna post skapades 2015-02-12.
CPL Pubid: 212469


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för informationsbehandling (1900-1987)


Datavetenskap (datalogi)

Chalmers infrastruktur