| In the era of computer network technology rapid development and the relational databaseis widely used, it is very important to protect the security of the relational database. Nowpeople has embedded the watermark in the multimedia data to protect its ownership, so wecan also embed the watermark to the relational database for copyright protection. For thisreason, many scholars have been added to the ranks of the study relational database digitalwatermarking.In this paper, on the basis of the analysis the existing relational database watermarking,algorithm, for numeric attributes in relational databases, proposed a relational databasewatermarking algorithm using K-Means based on the quantum-behaved particle swarmoptimization, improve the robustness of the relational database digital watermark. The mainresearch contents are as follows:Firstly, analysis of the theoretical knowledge of digital watermarking technology, basedon the depth understanding of the principles of digital watermarking algorithm, summarizedthe requirements of the embedding in the relational database watermarking and the relevantcommon several kinds of attacks, and deep analysis the advantages and disadvantages of theseveral existing relational database watermarking algorithm, proposed a new relationaldatabase watermarking algorithm based on the labeling strategies.Secondly, after analyzed the quantum particle swarm optimization algorithm andk-means clustering algorithm, proposed introduction a k-means clustering algorithm based onquantum-behaved particle swarm optimization to design a relational database watermarkingalgorithm, for this to achieve a relational database attribute data processing, by dispersing theembedding position of the watermarking information to increase the robustness of thealgorithm.Thirdly, based on the analysis of scrambling technology, proposed Arnoldtransformation to process the selected meaningful watermark in this article, thus even if theattackers is able to attack the watermarking information, if he do not know the number ofiterations, he can not able to identify the extracted watermark image, thus improving thesecurity of the embedded watermark information. Fourthly, for the watermark embedding algorithm and watermark extracting algorithm ofrelational database watermarking algorithm using k-means based on quantum-behavedparticle swarm optimization to specific design and simulation tests and in the analysis of thetest results. The test results show that the watermarking algorithm has a good ability to resistvarious attacks, and the relational database copyright protection can be achieved. |