Reversible Fragile Watermarking Scheme for Relational Database Based on Prediction-Error Expansion

Algorithm 1

Database relation partitioning.

(1)	For each tuple ti ∈ R do
(2)	hi = Hash (Ks||ti.Pk||Ks) //Primary key hash
(3)	j = hi mod  //group index
(4)	Insert tuple ti into group Gj
(5)	End for
	Sort all tuples in Gj in increasing order of their primary key hash
(6)	Return (G1, G2, …, )