| A Clas of Distributed Recognition Algorithms for Acyclic Database Schemes |
| |
| 引用本文： | 叶新铭,叶海薇. A Clas of Distributed Recognition Algorithms for Acyclic Database Schemes[J]. 内蒙古大学学报(自然科学版), 1997, 0(4) |
| |
| 作者姓名： | 叶新铭 叶海薇 |
| |
| 作者单位： | 内蒙古大学计算机科学系 |
| |
| 摘 要： | 各种非环的数据库模式有许多好的性质，特别是在分布式环境中，研究关系数据库的非环性程度是一个重要的课题．对Ａｌｐｈａ，Ｂｅｔａ，Ｇａｍｍａ，Ｂｅｒｇｅ这几种非环数据库模式，我们给出一组分布式算法．该算法的最坏消息复杂度是Ｏ（｜Ｎ｜２），而最坏时间复杂度是Ｏ（｜Ｎ｜２），其中｜Ｎ｜是给定的网络中结点的个数．
|
| 关 键 词： | 数据库模式 Alpha非环性 Beta非环性 Gamma非环性 Berge非环性 分布式算法 |
A Class of Distributed Recognition Algorithms for Acyclic Database Schemes |
| |
| Ye Xinming Ye Haiwei. A Class of Distributed Recognition Algorithms for Acyclic Database Schemes[J]. Acta Scientiarum Naturalium Universitatis Neimongol, 1997, 0(4) |
| |
| Authors: | Ye Xinming Ye Haiwei |
| |
| Abstract: | The acyclicity degree of a relational databases is an interesting topic due to several desirable properties of the corresponding database,especially in a distributed environment.A class of distributed algorithm DBPRUNE is proposed for recognizing an alpha ,beta ,gamma ,or Berge acyclic database scheme.The method is based on the non destributed algorithm PRUNE of 2 .The algorithms have a worst case message complexity O(|N| 2) and a worst case time complexity O(|N| 2), where |N| is the number of nodes for the given network. |
| |
| Keywords: | database scheme Alpha Beta Gamma Berge lacyclic distributed algorithm |
| 本文献已被 CNKI 等数据库收录！ |
