| A Distributed Algorithm for Determining Minimal Covers of Acyclic Database Schemes |
| |
| 作者姓名： | Ye Xinming |
| |
| 作者单位： | DepartmentofComputerScience,InnerMongoliaUniversity,Huhhot010021 |
| |
| 摘 要： | Acyclic databases possess several desirable properties for their design and use.A distributed algorithm is proposed for determining a minimal cover of an alpha-,beta-,gamma-,or Berge-acyclic database scheme over a set of attributes in a distributed environment.
|
| 关 键 词： | 非周期性数据库 设计 最小覆盖面 分布算法 |
A distributed algorithm for determining minimal covers of acyclic database schemes |
| |
| Ye Xinming.A Distributed Algorithm for Determining Minimal Covers of Acyclic Database Schemes[J].Journal of Computer Science and Technology,1994,9(3):204-214. |
| |
| Authors: | Xinming Ye |
| |
| Affiliation: | Department of Computer Science; Inner Mongolia University; Huhhot 010021; |
| |
| Abstract: | Acyclic databases possess several desirable properties for their design and use. Adistributed algorithm is proposed for determining a minimal cover of an alpha-, beta-,gamma-, or Berge-acyclic database scheme over a set of attributes in a distributedenvironment. |
| |
| Keywords: | Alpha- beta- gamma- Berge-acyclic depth-first-search tree distributed algorithm minimal cover hypergraph |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |
