Testing arbitrary subhypergraphs for the lossless join property

https://doi.org/10.1016/0020-0255(90)90019-7Get rights and content

Abstract

The properties required for an arbitrary subhypergraph to define an embedded join dependency are investigated. The nature of the functional dependencies required to insure the validity of the embedded join dependency is examined. An algorithm for testing an arbitrary subhypergraph for the losslessness property is given for functional dependencies embodied in the edges of the subhypergraph.

References (15)

  • C. Beeri et al.

    Properties of acyclic database schemes

  • C. Beeri et al.

    On the desirability of acyclic database schemes

    J. Assoc. Comput. Mach.

    (July 1983)
  • R. Fagin

    Degrees of acyclicity for hypergraphs and relational database schemes

    J. Assoc. Comput. Mach.

    (July 1983)
  • R. Fagin et al.

    A simplified universal relation assumption and its properties

    Trans. Database Systems

    (Sept. 1982)
  • M. Gyssens et al.

    A decomposition methodology for cyclic databases

    Adv. in Database Theory

    (1984)
  • W. Kent

    Consequences of assuming a universal relation

    ACM Trans Database Systems

    (1981)
  • H. Korth et al.

    System/U: A database system based on the universal relation assumption

    Trans. Database Systems

    (1984)
There are more references available in the full text version of this article.

Cited by (0)

View full text