{'fraction_non_alphanumeric': 0.011435832274459974, 'fraction_numerical': 0.0, 'mean_word_length': 5.512396694214876, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Cluster-Based Watermarking Technique for Relational Database

Database watermarking is an efficient method for database security. This paper proposes a cluster-based database watermarking technique which first applies cluster theory to the database watermarking technology. The cluster theory is used to cluster the source data and the clustering results determine the quantity of embedded watermark information and embedded position. This method makes the watermark information more disperse and hidden. This paper also introduces an odd-even modifying method to denote the watermarking information to decline the modification of original database. The results of experiment show this technique has a good performance on invisibility and is able to defend all kinds of subset attacks.