计算机科学 ›› 2013, Vol. 40 ›› Issue (4): 177-180.

• 软件与数据库技术 • 上一篇    下一篇

基于tableau结点封闭值的非一致性数据库开放分支修复方法

高龙,刘全,傅启明,李娇   

  1. 苏州大学计算机科学与技术学院苏州215006;苏州大学计算机科学与技术学院苏州215006;苏州大学计算机科学与技术学院苏州215006;苏州大学计算机科学与技术学院苏州215006
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金项目(61070223,61103045,61070122,61272005),江苏省自然科学基金(BK2012616),江苏省高校自然科学研究项目(09KJA520002,09KJB520012),吉林大学符号计算与知识工程教育部重点实验室项目(93K172012K04)资助

Method of Inconsistent Database Opening Branches Repairs Based on tableau Node Closed Value

GAO Long,LIU Quan,FU Qi-ming and LI Jiao   

  • Online:2018-11-16 Published:2018-11-16

摘要: 在将tableau方法扩展到非一致性数据库修复的基础上,提出一种新的利用分支封闭值修复数据库的方法。该方法结合tableau分析法的开放和封闭推理标准,以开放公式树TP(IC∪r)分支为基础,为公式树TP(IC∪r)中每个结点引入一个结点封闭值。根据TP(IC∪r)中结点封闭值的定义,通过计算TP(IC∪r)的结点封闭值来选择分支进行开放修复,从而可以直接确定数据库的修复实例,同时考虑了含有I封闭的修复,将开放修复扩展到含有I封闭的TP(IC∪r),并给予逻辑证明。最后,对于一致性应答结果的逻辑特征予以证明。

关键词: tableau,非一致性数据库,封闭值,开放,修复

Abstract: Based on extending the tableau method to inconsistent database repairs,a new method that uses the value of branch closure to repair the database was proposed.This method combines the analysis of tableau open and closed reasoning criterion,bases on opening formula tree TP(IC∪r),and imports a closed value for every node of the TP(IC∪r).According to the definition of node closed value, branches repair can be selected by computing node closed value,and directly determine the database instances which need repair.This method also considers repair with I closure and extends opening branches to repair,and gives the logical proof.At last,the logical feature of consistent query answer is proved.

Key words: tableau,Inconsistent database,Closed value,Open,Repair

[1] Bertossi L.Database repairing and consistent query answering [M].Morgan & Claypool publishers,2011
[2] Arenas M,Bertossi L,Chomicki J.Consistent query answers in inconsistent databases[C]∥ACM Symposium on Principles of Database Systems(ACM PODS’99).ACM Press,1999:68-79
[3] Bertossi L,Schwind C.An analytic tableaux based characterization of database repairs for consistent query answering(preliminary report)[C]∥Working Notes of the IJCAI’01Workshop on Inconsistency in Data and Knowledge.AAAI Press,2001:96-106
[4] 李娇,刘全,傅启明,等.分布式数据库中基于局部CON模型的记录匹配方法[J].通信学报,2011,32(7):196-202
[5] Fan W,Geerts F,Ma S,et al.Detecting inconsistencies in distributed data[C]∥the IEEE International Conference on Data Engineering (ICDE).2010:64-75
[6] Fan W,Jia X,Li J,et al.Reasoning about record matching rules[J].the International Conference on Very large Data Bases (VLDB),VLDB Endowment,2009,2(1):407-418
[7] Bertossi L.Consistent query answering in databases[J].ACM SIGMOD Record,2006,35(2):68-79
[8] Chomicki J,Marcinkowski J,Staworko S.Computing consistent query answers using conflict hypergraphs[C]∥ACM International Conference on Information and Knowledge Management.Washington DC:ACM Press,2004:417-426
[9] Elmagarmid A K,Ipeirotis P G,Verykois V S.Duplicate record detection:a survey[J].IEEE Transaction on Data and Know-ledge Engineering (TKDE),2007,19(1):1-16
[10] 刘全,伏玉琛,孙吉贵,等.一种基于符号集合的自动推理扩展方法[J].计算机研究与发展,2007,44(8):1317-1323
[11] 刘全,孙吉贵,崔志明.基于布尔剪枝的多值广义量词Tableau推理规则简化方法[J].计算机学报,2005,28(9):1514-1518
[12] Melvin F.First-order logic and automated theorem proving[M].New York:Springer Verlag,1996
[13] Golab L,Karloff H,Korn F,et al.On generating near optional tableaux for conditional functional dependencies[J].the International Conference on Very large Data Bases (VLDB),VLDB Endowment,2008,1(1):376-390

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!