Improved algorithm for relational data watermarking
一种改进的关系数据数字水印算法

Agrawal algorithm was introduced, which was easy to destroy data usability and sensitive to attributes ordering, an improved algorithm based on the improvement strategies of introducing percentage constraint and sorting attributes according to their cryptographic keyed hash values was presented. Deployments of the original and improved algorithm on real-life data show that the improved algorithm is able to preserve data usability more effectively, robust against attributes reordering attack, and it is a complete blind and more practical system .