Sökning: onr:"swepub:oai:gup.ub.gu.se/212469" >
Some results on the...
Some results on the deductive structure of join dependencies
-
- Dybjer, Peter, 1953 (författare)
- Gothenburg University,Göteborgs universitet,Institutionen för informationsbehandling,Department of computer science,University of Gothenburg,Chalmers tekniska högskola,Chalmers University of Technology
-
(creator_code:org_t)
- Elsevier BV, 1984
- 1984
- Engelska.
-
Ingår i: Theoretical Computer Science. - : Elsevier BV. - 0304-3975. ; 33:1, s. 95-105
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
https://doi.org/10.1...
-
https://gup.ub.gu.se...
-
https://doi.org/10.1...
-
https://research.cha...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas