高级检索

    基于属性分析表的基数为M的候选关键字一种求法

    AN ALGORITHM TO FIND THE CANDIDATE KEY WHOSE CARDINALITY IS M BASED ON THE ATTRIBUTES ANALYSIS TABLE

    • 摘要: 本文详细分析了文献[3]的属性相关表,提出了属性分析表的概念、构造规则。同时,还提出了关联属性分析表、双元属性分析表、纯双元属性分析表等概念,定义了相应的运算。并在此基础上,给出了一种基于分析表的基数为M的候选关键字的求解方法。

       

      Abstract: In this paper,the attributes relative table in 3 is analyzed in detail, and the concept of attributes analysis table and the constructing rules are presented. The concepts of associated attributes analysis table, both-hands meta-attributes analysis table, pure both-hands meta-attributes analysis table, etc. are also presented, and the relevant operations are defined. Finally, an algorithm to find the candidate key, whose cardinality is M, based on the attributes analysis table, is given.

       

    /

    返回文章
    返回