This paper is concerned with the problem of designing acyclic database schemata. In particular, given a database schema B described by one full join dependency and a set of functional dependencies, it is desired to know whether there exists an acyclic schema equivalent to B. This problem is relevant because its solution is preliminary to every attempt at finding a convenient acyclic representation of B. Proposed are hypergraph formalism and hypergraph algorithms for the solution of the above problem.
On the Recognition of Coverings of Acyclic Database Hypergraphs
SACCA', Domenico
1983-01-01
Abstract
This paper is concerned with the problem of designing acyclic database schemata. In particular, given a database schema B described by one full join dependency and a set of functional dependencies, it is desired to know whether there exists an acyclic schema equivalent to B. This problem is relevant because its solution is preliminary to every attempt at finding a convenient acyclic representation of B. Proposed are hypergraph formalism and hypergraph algorithms for the solution of the above problem.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
