activity
20012026
most citedA Tight Upper Bound on the Number of Candidate Patterns

33 citations · 143 across the 28 of their papers we have counts for

collaborators
Showing 2026Show all

1 paper · 1 filter

cs.DB2026

On the generic information capacity of relational schemas with a single binary relation

Benoît Groz, Jan Hidders, Nina Pardal +2

We consider database schemas consisting of a single binary relation, with key constraints and inclusion dependencies. Over this space of 20 schemas, we completely characterize when…