# A Survey of Intellectual Property Rights Protection in Big Data Applications +
## 5 Discussion  
To promote accountability and responsible data sharing for all stakeholders, a different technical framework based on fiducary legal concepts is urgently needed. Our investigation also found that data ownership and protection techniques are limited and may not solve the problems with cross-data platforms and Big Data applications. As stated in this paper, we do not believe that essential shared data should be protected as individual intellectual property because there are no specific rights for cross-database platforms. Data sharing becomes much more difficult under this type of ownership, especially when using cross-data services [11]. Small R&D companies may not benefit sufficiently from existing patents and face various obstacles to using or developing innovative technologies because of the issue of intellectual property protection for inventions. In this context, the problem that it is difficult for a R&D company to retain ownership of innovation was raised. The reason is that other IT companies that have not invested as much in the development could duplicate the idea and offer the new product at a lower price, putting the inventor out of business. \begin{table}
\begin{tabular}{p{42.7 pt} p{113.8 pt} p{113.8 pt} p{113.8 pt} p{113.8 pt}} \hline \hline
**Ref ID** & **Applications** & **Goals** & **Approaches** & **Evaluation Metric** & **Limitations** \\ \hline
[61] & Multimedia & \begin{tabular}{c} To solve the problem of copyright \\ confirmation and protection. \\ \end{tabular} & \begin{tabular}{c} Full nodes and \\ lightweight nodes \\ \end{tabular} & \
\begin{tabular}{c} Precision \\ and recall \\ \end{tabular} &
\begin{tabular}{c} Optimizing the process \\ during extracting eigenvalues \\ to decrease computation time. \\ \end{tabular} \\ \hline
[62] & Videos & \begin{tabular}{c} To create a simplification algorithm \\ by direct extraction without \\ performing synchronization for \\ simple geometric attacks. \\ \end{tabular} & \begin{tabular}{c} 2-D DFT \\ (two-dimensional \\ discrete Fourier \\ transform) \\ \end{tabular} & \
\begin{tabular}{c} PSNR and \\ SSIM \\ \end{tabular} &
\begin{tabular}{c} The effectiveness of proposed \\ method is low against frame \\ dropping attacks. \\ \end{tabular} \\ \hline
[63] & Images & \begin{tabular}{c} To create the features of de-trusted \\ third parties with combining the \\ fairness and process automation of \\ smart contracts to make up for the \\ shortcomings of the \\ zero-watermarking algorithm. \\ \end{tabular} & \
\begin{tabular}{c} Blockchain and \\ Zero-Watermark \\ \end{tabular} & NC &
\begin{tabular}{c} Due to cost constraints, it is \\ almost impossible to make the \\ absolute credibility of the \\ third party in the digital \\ watermarking technology. \\ \end{tabular} \\ \hline
[64] & Musics & \begin{tabular}{c} To address the problem of illegal \\ distribution of copyright-protected \\ music files without the consent of the \\ owners, which has negative \\ consequences in the music industry. \\ \end{tabular} & \begin{tabular}{c} A public- \\ permission-less \\ blockchain \\ \end{tabular} & \
\begin{tabular}{c} File size vs \\ uploading \\ cost \\ \end{tabular} &
\begin{tabular}{c} Smart contracts cannot be \\ able to pull data from \\ off-chain resources; instead, \\ that data should be “pushed” \\ to the smart contract. \\ \end{tabular} \\ \hline
[65] & Videos & \begin{tabular}{c} To address poor robustness, weak \\ imperceptibility and difficulty in \\ traceability of the current protection \\ schemes for video copyright \\ \end{tabular} & \begin{tabular}{c} blockchain with \\ two layers: \\ “on-chain”and \\ “off-chain” \\ \end{tabular} & NC and \
\begin{tabular}{c} Precision \\ ratio \\ \end{tabular} &
\begin{tabular}{c} The proposed system has low \\ accuracy on noise attack. \\ \end{tabular} \\ \hline \hline \end{tabular}
\end{table} 
Table 4: An overview of non-watermarking and hybrid algorithms for copyright applications on multimedia data.