期刊文献+

属性集闭包求解算法的C++实现 被引量:1

The Realization of the Attribute Sets Closure Algorithm in C++
下载PDF
导出
摘要 在关系数据理论中,属性集闭包的求解不仅是证明Armstrong公理系统的基础,也是关系数据库逻辑模式设计中各种模式分解算法的基础。研究了属性集闭包求解算法的机制,并利用VC++实现了该算法。 In the relation data theory, the solution of attribute set closure is not only the foundation of proving Armstrong justice system, but also is the foundation of various kinds of mode decomposition algorithm in the design of a relational database logic pattern. The article research the mechanism of attribute sets closure algorithm, and make it in realization by using VC++.
作者 汪韬 敬茂华
出处 《电脑编程技巧与维护》 2012年第14期26-28,共3页 Computer Programming Skills & Maintenance
关键词 公理系统 关系模式 函数依赖 属性集闭包 Justice Systeom Relation Schema Functionally dependant Closure of attribute sets
  • 相关文献

参考文献3

二级参考文献5

  • 1Mannila H, Raihi K-J. Algorithms for inferring functional dependencies from relations. Data and Knowledge Engineering, 1994,12(1):83-99.
  • 2Huhtala Y, Kārkkāinen J, Porkka P, Toivonen H. Tane: An efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 1999,42(2): 100-111
  • 3Savnik I. Bottom-Up induction of functional dependencies from relations. In: Piatetsky-Shapiro G, ed. Proceedings of the AAAI'93 Workshop on Knowledge Discovery in Databases. 1993. 174-185.
  • 4Beeri C, Dowd M, Fagin R, Statman R. On the structure of Armstrong relations for functional dependencies. Journal of the ACM,1984,31(1):30-46.
  • 5Lopes S, Petit J-M, Lakhal L. Efficient discovery of functional dependencies and Armstrong relations. In: Proceedings of the EDBT 2000. LNCS 1777, Heidelberg: Springer-Verlag, 2000. 350--364.

共引文献10

同被引文献3

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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