非一致性数据库关键词非聚集约束查询与性能分析  

Keyword search of nonaggregate constraints and capability analysis based on inconsistent database

作　　者：刘波[1] 雷刚跃[2] 杨路明[1] 邓云龙[3] 

机构地区：[1]中南大学信息学院,长沙410083 [2]湖南信息职业技术学院,长沙410200 [3]中南大学湘雅三医院,长沙410013

出　　处：《计算机应用研究》2007年第10期107-109,112,共4页Application Research of Computers

基　　金：中南大学大学生创新创业启航行动重点资助创新项目(ZB018)

摘　　要：在分析非一致性数据库一致性查询方法的基础上,结合非聚集约束条件,以关键词为元数据,利用B-树与二叉树的原理,提出一种新的针对非一致性数据库的查询方法。通过节点分组访问、分层迭代查询的方法,不仅解决非一致性数据库约束条件难写的问题,而且容易组合选择查询条件,有助于提高查询的灵活性与准确性。On the basis of analysis by consistent query answer of inconsistent database, and of nonaggregate constraints, keyword as metadata, the principle of the B-tree and binary tree, found a new research method to inconsistent database. By the methods of grouping visit , of iterative and layered research, it was not only resolving the difficult for writing T-SQL, but also combining easily, helping to the vivid and the accuracy of searching.

关 键 词：非一致性数据库 完整性约束 修改 一致性查询 非聚集约束 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]