A Distributed Algorithm for Determining Minimal Covers of Acyclic Database Schemes
A Distributed Algorithm for Determining Minimal Covers of Acyclic Database Schemes作者机构:Department of Computer Science Inner Mongolia University Huhhot
出 版 物:《Journal of Computer Science & Technology》 (计算机科学技术学报(英文版))
年 卷 期:1994年第9卷第3期
页 面:204-214页
核心收录:
学科分类:12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0808[工学-电气工程] 0835[工学-软件工程] 0701[理学-数学] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术(可授工学、理学学位)]
主 题:Alpha- beta- gamma- Berge-acyclic depth-first-search tree distributed algorithm minimal cover hypergraph
摘 要: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.