期刊文献+

A Distributed Algorithm for Determining Minimal Covers of Acyclic Database Schemes

A Distributed Algorithm for Determining Minimal Covers of Acyclic Database Schemes
原文传递
导出
摘要 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.
作者 叶新铭
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 1994年第3期204-214,共11页 计算机科学技术学报(英文版)
关键词 Alpha- beta- gamma- Berge-acyclic depth-first-search tree distributed algorithm minimal cover HYPERGRAPH Alpha-, beta-, gamma-, Berge-acyclic, depth-first-search tree, distributed algorithm, minimal cover, hypergraph
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部