• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (8): 149-155.

• 论文 • Previous Articles     Next Articles

An incremental discovering algorithm
for conditional functional dependencies       

LI Dingyue1,LIU Jianxun2,ZHAI Haijun2   

  1. (1.School of Information Engineering,Xiangtan University,Xiangtan 411100;
    2.Key Laboratory of Knowledge Processing and Networked Manufacturing,
    Hunan University of Science and Technology,Xiangtan 411100,China)
  • Received:2012-06-25 Revised:2012-08-31 Online:2013-08-25 Published:2013-08-25

Abstract:

If the database is updated frequently, Conditional Functional Dependencies (CFDs) that have met the conditions may changes.. In order to obtain accurate CFDs, we can rerun the discovering process over the updated database. However, it spends a lot of time on dealing with the original dataset. Aiming at this problem, based on CFINDER algorithm, the paper proposed an incremental discovering algorithm for CFDs, which is named as CFUP. When a batch of new data is added to the database, the CFUP algorithm scans dataset to decide whether existing CFDs is valid or not, and the new data produces new CFDs, to achieve an incremental update for CFDs. Experiments show that the CFUP algorithm can effectively find CFDs by using information from the last discovering process. Compared with the rerun of the CFINDER algorithm, it can reduce the scanning number to original dataset and improve the efficiency of discovering CFDs.

Key words: conditional functional dependencies;incremental algorithm;database