A query algorithm based on homomorphism counts is a procedure for determ...
We propose a new framework for combining entity resolution and query
ans...
The framework of database repairs and consistent answers to queries is a...
A classical result by Lovász asserts that two graphs G and H are
isomorp...
Since the early days of relational databases, it was realized that acycl...
In several different settings, one comes across situations in which the
...
We investigate the practical aspects of computing the necessary and poss...
Constraints on entropies are considered to be the laws of information th...
The Possible Winner (PW) problem, a fundamental algorithmic problem in
c...
The query containment problem is a fundamental algorithmic problem in da...
An inconsistent database is a database that violates one or more integri...
In several different applications, including data transformation and ent...
We develop a novel framework that aims to create bridges between the
com...