
Enumerating Answers to FirstOrder Queries over Databases of Low Degree
A class of relational databases has low degree if for all δ>0, all but f...
read it

ModelChecking on Ordered Structures
We study the modelchecking problem for first and monadic secondorder ...
read it

Firstorder queries on classes of structures with bounded expansion
We consider the evaluation of firstorder queries over classes of databa...
read it

Smooth Approximations and Relational Width Collapses
We prove that relational structures admitting specific polymorphisms (na...
read it

Relational Width of FirstOrder Expansions of Homogeneous Graphs with Bounded Strict Width
Solving the algebraic dichotomy conjecture for constraint satisfaction p...
read it

Towards faster isomorphism tests for boundeddegree graphs
Luks' algorithm (JCSS 1982) to test isomorphism of bounded degree graphs...
read it

Generalized Graph Pattern Matching
Most of the machine learning algorithms are limited to learn from flat d...
read it
Query Preserving Watermarking Schemes for Locally Treelike Databases
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 firstorder and monadic second order queries. For relational structures whose Gaifman graphs have bounded degree, watermarking can be done preserving firstorder 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 treewidth and is closed under minors, watermarking schemes exist that preserve firstorder 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.
READ FULL TEXT
Comments
There are no comments yet.