Core Concepts
The core message of this paper is to introduce a declarative framework for relational databases that allows specification of different meanings of equality at a high level of abstraction, and to study the impact of this framework on functional dependencies.
Abstract
The paper introduces a lattice-based declarative framework for relational databases that allows domain experts to specify different interpretations of equality as first-class citizens. The key concepts are:
Comparability functions: Attribute-wise mappings that assign abstract values representing the degree of similarity between pairs of domain values.
Abstract lattices: Partially ordered sets of abstract values that capture the semantics of comparability.
Interpretations: Mappings from abstract values to binary equality/inequality that are increasing with respect to the lattice order.
The authors show that this framework generalizes the classical relational model and the SQL model with null values. They then study functional dependencies (FDs) in this context:
Abstract FDs: FDs defined in terms of the abstract lattice, capturing dependencies between abstract tuples.
Realities: Interpretations that preserve the semantics of classical FDs, turning the abstract lattice into a closure system.
Possible/Certain FDs: FDs that hold under some/all realities, capturing the plausibility of FDs in the presence of uncertain data.
The authors provide complexity results for deciding the possibility and certainty of FDs, showing that deciding strong possibility is NP-complete.