...
首页> 外文期刊>International Journal of Database Management Systems >Algorithm for Relational Database Normalization Up to 3NF
【24h】

Algorithm for Relational Database Normalization Up to 3NF

机译:最高3NF的关系数据库规范化算法

获取原文
           

摘要

When an attempt is made to modify tables that have not been sufficiently normalized undesirable sideeffects may follow. This can be further specified as an update, insertion or deletion anomaly depending on whether the action that causes the error is a row update, insertion or deletion respectively. If a relation R has more than one key, each key is referred to as a candidate key of R. Most of the practical recent works on database normalization use a restricted definition of normal forms where only the primary key (an arbitrary chosen key) is taken into account and ignoring the rest of candidate keys. In this paper, we propose an algorithmic approach for database normalization up to third normal form by taking into account all candidate keys, including the primary key. The effectiveness of the proposed approach is evaluated on many real world examples.
机译:当试图修改尚未充分归一化的表时,可能会出现不良的副作用。可以根据导致错误的操作分别是行更新,插入还是删除来进一步将其指定为更新,插入或删除异常。如果关系R具有多个键,则每个键都称为R的候选键。最近有关数据库规范化的大多数实际工作使用对正则形式的受限定义,其中只有主键(任意选择的键)是考虑并忽略其余的候选键。在本文中,我们通过考虑所有候选密钥(包括主密钥),提出了一种将数据库规范化为第三范式的算法。在许多实际示例中都对所提出方法的有效性进行了评估。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号