识别三种非环数据库模式的分布式算法

A Distributed Algorithm for recognizing Acyclic Database Schemes

对α－，β－，Ｂ－这几种非环数据库模式，在分布式环境中给出如何识别它们的算法ＤＢＦＰＲＵＮＥ．该算法最坏的消息复杂度是Ｏ（ｎ￣２＋ｍ），而最坏的时间复杂度是Ｏ（ｎ￣２），其中ｎ是网络中结点的个数，ｍ是网络上边的个数．

distributed algorithm for recognizing θ-acyclic dataabase schemes(θ=α,β,B) is proposed.The algorithm has a worst-case message complexity O(n￣2+m) and a worst-case time complexityO(n￣2),where n is the number of nodes and m is the number of edges for given network.