Query Preserving Watermarking Schemes for Locally Treelike Databases

TL;DR

This paper extends watermarking schemes to relational structures with Gaifman graphs of locally bounded tree-width, ensuring preservation of first-order query outputs in complex graph classes.

Contribution

It introduces new watermarking schemes for structures with locally bounded tree-width, broadening the classes of graphs where query-preserving watermarking is possible.

Findings

Watermarking schemes exist for structures with locally bounded tree-width.

Preservation of first-order queries is achievable in these graph classes.

The work bridges algorithm design, graph theory, and watermarking techniques.

Abstract

Watermarking is a way of embedding information in digital documents. Much research has been done on techniques for watermarking relational databases and XML documents, where the process of embedding information shouldn't distort query outputs too much. Recently, techniques have been proposed to watermark some classes of relational structures preserving first-order and monadic second order queries. For relational structures whose Gaifman graphs have bounded degree, watermarking can be done preserving first-order queries. We extend this line of work and study watermarking schemes for other classes of structures. We prove that for relational structures whose Gaifman graphs belong to a class of graphs that have locally bounded tree-width and is closed under minors, watermarking schemes exist that preserve first-order queries. We use previously known properties of logical formulas and graphs, and build on them with some technical work to make them work in our context. This constitutes a part of the first steps to understand the extent to which techniques from algorithm design and computational learning theory can be adapted for watermarking.