一种新的关系数据库水印方法  

A New Watermark Algorithm for Relational Databases

作　　者：王佳[1] 曹加恒[1] 黄敏[1] 

机构地区：[1]武汉大学计算机系,武汉430072

出　　处：《计算机工程与应用》2005年第33期162-165,共4页Computer Engineering and Applications

摘　　要：目前关系数据的权利保护问题已引起人们广泛的关注,对数据库嵌入水印是一种有效的解决办法。该文提出了一种新的数据库水印方法,分析了该方法对各种主要攻击,如元组重新排序、子集选择、属性删除等的抵抗能力。最后该文实现了这种水印方法并给出了实验数据,证明了该算法具有很强的鲁棒性。Protecting rights over relational data is of ever increasing interest at the present time and inserting the watermarks into the databases is a effective way.In this paper we present a new algorithm of watermarking for databases and analyze the ability of resisting important attacks,such as re-sorting,subset selection,tuple deleting.Finally we have implemented the algorithm and given the experiment results which prove that the algorithm is very robust.

关 键 词：水印 数据库 有效性 

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