A Distributed Algorithm for Determining Minimal Covers of Acyclic Database Schemes  

作　　者：叶新铭 

出　　处：《Journal of Computer Science & Technology》1994年第3期204-214,共11页计算机科学技术学报（英文版）

摘　　要：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.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.

关 键 词：Alpha- beta- gamma- Berge-acyclic depth-first-search tree distributed algorithm minimal cover HYPERGRAPH 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]