Recognizing Four type Acyclic Database Schemes by Using the Line Graph of the Scheme in a Distributed Environment
Tie Liu · Acta Scientiarum Naturalium Universitatis Neimongol · 1999
We gave a new algorithm for recognizing four type acyclic database schemes(namely: Alpha-,Beta-,Gamma-,Berge-acyclicity) by using the line graph of the scheme in a distributed environment. The algorithm has a worst-case message complexity O(|E|),where |E| is the number of pairs of relations of the database scheme with at least one attribute in common.