In this chapter classes of acyclic hypergraphs associated with classes of relational database schemata are investigated. Various concepts of minimal ...
In this chapter classes of acyclic hypergraphs associated with classes of relational database schemata are investigated. Various concepts of minimal ...
A distributed algorithm for determining minimal covers of acyclic ...
www.semanticscholar.org › paper
A distributed algorithm is proposed for determining a minimal cover of an alpha-, beta-, gamma-, or Berge-acyclic database scheme over a set of attributes ...
The importance of acyclic database schemes in relational database theory has been pointed out in various contributions in the literature.
A distributed algorithm for determining minimal covers of acyclic database schemes · Degrees of acyclicity for hypergraphs and relational database schemes.
Missing: Schemata. | Show results with:Schemata.
Nov 21, 2024 · A large number of desirable properties of database schemes fall into a small number of equivalence classes, each completely characterized by the ...
Moscarini, "Minimal Coverings of Acyclic Database Schemata", Proceedings ONERA-CERT Workshop on "Logical Bases for Databases", Toulouse, France, (Dec. 1982) ...
Minimal Coverings of Acyclic Database Schemata. Advances in Data Base Theory 1982: 27-51. no documents available. no references & citations available. export ...
摘要: Acyclic databases possess several desirable properties for their design and use. Adistributed algorithm is proposed for determining a minimal cover of ...
Abstract. The importance of acyclic database schemes in relational database theory has been pointed out in various contributions in the literature.