期刊文献+

基于函数依赖的导出关系候选码计算 被引量:2

Candidate Code Calculation of Derived Relation Based on Functional Dependencies
下载PDF
导出
摘要 基于函数依赖的候选码计算在基于压缩策略的快照差分算法、数据一致性检测、数据不一致修复、数据完整性约束等方面有重要的作用。分析选择、并、差、笛卡尔积等基本运算的函数依赖保持性,得出导出关系候选码与原准基础关系候选码的关系,针对投影、广义投影、笛卡尔积和聚集运算候选码可能存在冗余属性的情况,给出相应的算法优化组成候选码的属性。提出一种递归算法对给定的导出关系求出其候选码,运用快照差分算法进行实验,结果表明,运用该算法可以提高增量计算的运行效率。 Candidate code calculation based on the functional dependencies has important uses in many aspects, such as in the snapshot differential algorithms based on the strategy of compression, in the data consistency inspection, in the data inconsistency repairmen and in the data integrity constraints. This paper discusses and analyzes the retaining ability of functional dependence for several basic operations such as selecting, excepting, unions and cartesian product. A conclusion on the relationship between the candidate code of derived relation and the candidate code of the original basic relations is presented. It proposes a corresponding algorithm to optimize the size of candidate attributes for projection,the generalized projection, cartesian product and aggregation operation that may have redundant attributes in their candidate code. An algorithm is proposed that can find out the candidate code for a given derived relation, and experiments are conducted applying into the snapshot differential algorithms. Results show that the algorithm can improve the efficiency of the incremental calculation.
出处 《计算机工程》 CAS CSCD 北大核心 2016年第5期60-65,共6页 Computer Engineering
基金 广东省自然科学基金资助项目(S2012010008831 2015A030310208) 广东省教育部产学研结合基金资助项目(2007B090400095)
关键词 候选码计算 导出关系 函数依赖 快照差分 一致性 candidate code calculation derived relation functional dependencies snapshot differential consistency
  • 相关文献

参考文献15

  • 1Garcia-Molina H,Labio W J.Efficient Snapshot Differential Algorithms for Data Warehousing[C]//Proceedings of IEEE International Conference on Very Large Data Bases.Washington D.C.,USA:IEEE Press,1996:63-74.
  • 2Labio W J,Garcia-Molina H.Comparing Very Large Database Snapshots[C]//Proceedings of IEEE International Conference on Very Large Data Bases.Washington D.C.,USA:IEEE Press,1995:995-1001.
  • 3Xie Baoyong.An Effective Algorithm for Calculating a Candidate Key of Relational Scheme[J].Modern Computer,2002,(5).
  • 4Fuxman A D,Miller R J.First-order Query Rewriting for Inconsistent Databases[C]//Proceedings of Database Theory-ICDT’05.Berlin,Germany:Springer,2005:337-351.
  • 5Huhtala Y,Krkkinen J,Porkka P,et al.TANE:An Efficient Algorithm for Discovering Functional and Approximate Dependencies[J].The Computer Journal,1999,42(2):100-111.
  • 6de Marchi F,Lopes S,Petit J M.Efficient Algorithms for Mining Inclusion Dependencies[C]//Proceedings of Advances in Database Technology-EDBT’02.Berlin,Germany:Springer,2002:464-476.
  • 7Feng Yucai.Algorithm for Solving Candidate Key by Graph Theory[J].Chinese Journal of Computers,1988,11(1):18.
  • 8冯玉才.候选关键字的图论求解法[J].计算机学报,1988,11(9):556-558.
  • 9李卫榜,李战怀,陈群,姜涛,刘海龙,潘巍.分布式大数据函数依赖发现[J].计算机研究与发展,2015,52(2):282-294. 被引量:9
  • 10张方舟,高晓松.基于条件函数依赖的挖掘算法研究[J].计算机技术与发展,2015,25(5):56-59. 被引量:6

二级参考文献15

共引文献14

同被引文献8

引证文献2

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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