Hypergraph has been proven to be a very useful structure in relational database theory. The family of relational schemes or join dependencies can be divided into acyclic and cyclic, according to their associated hypergraphs. The GYO Algorithm is an efficient algorithm to decompose an acyclic join dependency into a set of multivalued dependencies, but it fails on cyclic join dependencies. A new algorithm extended from the GYO Algorithm is given to decompose a cyclic join dependency into a set of smaller join dependencies. This algorithm also works for acyclic join dependencies.
Permanent URL for this record: https://lbezone.hkust.edu.hk/bib/b672602
Post a Comment