[Paper Review] Relational lattices via duality

Luigi Santocanale|arXiv (Cornell University)|Feb 26, 2016

Data Management and Algorithms7 references3 citations

TL;DR

This paper uses duality theory to characterize relational lattices via generalized ultrametric spaces, establishing an equational axiomatization based on symmetry and pairwise completeness of the dual space. It proves that the quasiequational theory of relational lattices in the pure lattice signature is undecidable, linking the problem to modal logic via p-morphisms from universal S5^n-product frames.

ABSTRACT

The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed lattice theory as an alternative algebraic approach to databases. Aiming at query optimization, Litak et al. [12] initiated the study of the equational theory of these lattices. We carry on with this project, making use of the duality theory developed in [16]. The contributions of this paper are as follows. Let A be a set of column's names and D be a set of cell values; we characterize the dual space of the relational lattice R(D, A) by means of a generalized ultrametric space, whose elements are the functions from A to D, with the P (A)-valued distance being the Hamming one but lifted to subsets of A. We use the dual space to present an equational axiomatization of these lattices that reflects the combinatorial properties of these generalized ultrametric spaces: symmetry and pairwise completeness. Finally, we argue that these equations correspond to combinatorial properties of the dual spaces of lattices, in a technical sense analogous of correspondence theory in modal logic. In particular, this leads to an exact characterization of the finite lattices satisfying these equations.

Motivation & Objective

• To develop an equational axiomatization of relational lattices in the pure lattice signature using duality theory.
• To characterize the dual space of the relational lattice R(D,A) as a generalized ultrametric space with P(A)-valued Hamming distance.
• To link combinatorial properties of the dual space—symmetry and pairwise completeness—to equational laws in lattice theory.
• To establish the undecidability of the quasiequational theory of relational lattices by reducing it to the existence of p-morphisms from universal S5^n-product frames.
• To extend duality theory to infinite lattices and explore its correspondence-theoretic potential for relational lattices.

Proposed method

• Represent the relational lattice R(D,A) as a complete spatial lattice and identify its completely join-irreducible elements with A ⊔ D^A.
• Construct the dual space as a P(A)-valued ultrametric space on D^A, where the distance δ(f,g) = {x ∈ A | f(x) ≠ g(x)}.
• Define the OD-graph of R(D,A) using the minimal join-covers of join-irreducible elements, with f ∈ D^A having minimal covers δ(f,g) ∪ {g} for g ≠ f.
• Use the duality framework to translate lattice equations into combinatorial properties of the dual space, analogous to correspondence theory in modal logic.
• Establish a surjective p-morphism from a universal S5^n-product frame to a full initial frame if and only if the corresponding lattice embeds into a relational lattice.
• Leverage known undecidability results for modal logic to infer the undecidability of the quasiequational theory of relational lattices.

Experimental results

Research questions

• RQ1 Which equational laws govern relational lattices in the pure lattice signature, and how can they be derived from structural properties of their dual spaces?
• RQ2 Can the combinatorial properties of the dual space—specifically symmetry and pairwise completeness—be used to axiomatize the equational theory of relational lattices?
• RQ3 Is there a correspondence between equations in the equational theory of relational lattices and the geometric or topological features of their dual ultrametric spaces?
• RQ4 To what extent can duality theory be extended to infinite relational lattices, and what new correspondence mechanisms emerge?
• RQ5 Does the existence of a p-morphism from a universal S5^n-product frame to a given frame correspond precisely to the embeddability of the associated lattice into a relational lattice?

Key findings

• The dual space of the relational lattice R(D,A) is a P(A)-valued ultrametric space on D^A, with the distance δ(f,g) = {x ∈ A | f(x) ≠ g(x)}.
• The minimal join-covers of elements in D^A are characterized by δ(f,g) ∪ {g}, and these structures underlie the equational axioms.
• The equational theory of relational lattices is axiomatized by symmetry and pairwise completeness of the dual space, which correspond to lattice equations.
• A surjective p-morphism exists from a universal S5^n-product frame to a full initial frame if and only if the associated lattice embeds into a relational lattice.
• The quasiequational theory of relational lattices in the pure lattice signature is undecidable, as shown by reduction to the undecidability of p-morphism existence in modal logic.
• The results establish a novel correspondence between lattice equations and combinatorial properties of dual spaces, extending the scope of duality theory to relational lattices.