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

Abstract

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 one schema is generically dominated by another schema. Generic dominance, a classical notion for measuring information capacity, expresses that every instance of a schema can be uniquely represented in the dominating schema, through application of a deterministic, generic data transformation. Our investigation is motivated both by current interest in schema design for graph databases, as well as by intrinsic scientific interest. We also consider the ternary case, but without inclusion dependencies, and discuss how the notions change in the presence of object identifiers.

Figures (1)

• Figure 1: Left: Generic dominance relationships over single binary relation schemes with keys and inclusion dependencies. Right: Conceptual illustration of the indicated graph classes. They are defined formally in Section .

Theorems & Definitions (25)

• Remark 3.1
• Example 3.2
• Example 3.3: hull_siam
• Example 3.4
• Example 3.5
• Proposition 3.6
• Theorem 3.7
• Theorem 4.1
• Lemma 4.2
• Lemma 4.3