A formal context for symmetric dependencies

Authors:
Jaume Baixeries
Affiliations:
Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Catalonia
Venue:
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Year:
2008

Citing 9
Cited 1

Functional dependencies in relational databases: a lattice point of view

Discrete Applied Mathematics - Special issue on combinatorial problems in databases
A lattice interpretation of database dependencies

Semantics of programming languages and model theory
Normal form relation schemes: a new characterization

Acta Cybernetica
On the menbership problem for functional and multivalued dependencies in relational databases

ACM Transactions on Database Systems (TODS)
A complete axiomatization for functional and multivalued dependencies in database relations

SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Principles of Database Systems

Principles of Database Systems
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey

Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Characterization and armstrong relations for degenerate multivalued dependencies using formal concept analysis

ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis

Border algorithms for computing hasse diagrams of arbitrary lattices

ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Armstrong and symmetric dependencies are two of the main groups of dependencies in the relational database model, both of them having their own set of axioms. The closure of a set of dependencies is the largest set of dependencies that can be calculated by the recursive application of those axioms. There are two problems related to a closure: its calculation and its characterization. Formal concept analysis has dealt with those problems in the case of Armstrong dependencies (that is, functional dependencies and alike). In this paper, we present a formal context for symmetric dependencies that calculates the closure and the lattice characterization of a set of symmetric dependencies.