Empirical analysis of the impact of queries on watermarked relational databases

被引:1
|
作者
Olliaro, Martina [1 ]
Gort, Maikel Lazaro Perez [1 ]
Cortesi, Agostino [1 ]
机构
[1] Ca Foscari Univ Venice, Sci Campus,Via Torino 155, I-30172 Venice, Italy
关键词
Empirical analysis; Relational data; SQL queries; Watermark preservation; Watermarking techniques; SCHEME;
D O I
10.1016/j.eswa.2022.117491
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Robust relational database watermarking techniques aim to preserve the watermark in the protected assets despite daily updates and malicious attacks. Nevertheless, most techniques do not analyze the root of operations that can degrade the embedded watermark signal, being that the case of Structured Query Language (SQL) queries for relational data. In this paper, we perform an empirical analysis of the role played by different types of SQL queries in the persistence and degradation of a watermark signal in a relational data set. According to the type of operation, we present a set of alternatives for the watermark detection process, contributing to the extraction of an ownership copyright signals threshold. Moreover, our proposal allows data owners to consider variations for the selected watermarking technique, according to the suspected malicious operation performed in the copy of available data. Finally, we give evidence of the importance of some features to be considered when selecting a watermark source, making possible the resilience against update operations that affect a high amount of protected data and the enhancement of a partially detected watermark.
引用
收藏
页数:16
相关论文
共 50 条
  • [41] Efficient execution of aggregation queries over encrypted relational databases
    Hacigümüs, H
    Iyer, B
    Mehrotra, S
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, 2004, 2973 : 125 - 136
  • [42] Producing Interoperable Queries for Relational and Object-Oriented Databases
    Ya-Hui Chang
    Louiqa Raschid
    Journal of Intelligent Information Systems, 2000, 14 : 51 - 75
  • [43] Declarative PTIME queries for relational databases using quantifier elimination
    Doherty, P
    Lukaszewicz, W
    Szalas, A
    JOURNAL OF LOGIC AND COMPUTATION, 1999, 9 (05) : 737 - 758
  • [44] Enhancing hierarchical queries in relational databases with the nested set representation
    Pietarinen, L
    Novikov, B
    Databases and Information Systems, 2005, 118 : 65 - 77
  • [45] Update conscious inverted indexes for XML queries in relational databases
    Hong, DK
    Kim, KY
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2004, 3180 : 263 - 272
  • [46] An Empirical Analysis of Semantic Web Mechanisms for Storage and Query of Ontologies in Relational Databases
    Kwuimi, Raoul
    Dombeu, Jean V. Fonou
    Tranos, Zuva
    2016 THIRD INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATION AND ENGINEERING (ICACCE 2016), 2016, : 132 - 136
  • [47] An Efficient Algorithm for Processing Multi-Relation Queries in Relational Databases
    刘惟一
    JournalofComputerScienceandTechnology, 1990, (03) : 236 - 240
  • [48] Mining frequent conjunctive queries in relational databases through dependency discovery
    Bart Goethals
    Dominique Laurent
    Wim Le Page
    Cheikh Tidiane Dieng
    Knowledge and Information Systems, 2012, 33 : 655 - 684
  • [49] Implementation of Projected Clustering based on SQL queries and UDFs in Relational Databases
    Harikumar, Sandhya
    Haripriya, H.
    Kaimal, M. R.
    2013 IEEE RECENT ADVANCES IN INTELLIGENT COMPUTATIONAL SYSTEMS (RAICS), 2013, : 7 - 12
  • [50] Mining frequent conjunctive queries in relational databases through dependency discovery
    Goethals, Bart
    Laurent, Dominique
    Le Page, Wim
    Dieng, Cheikh Tidiane
    KNOWLEDGE AND INFORMATION SYSTEMS, 2012, 33 (03) : 655 - 684