Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Database Dependencies and Formal Concept Analysis

Jaume Baixeries

Abstract

This is an account of the characterization of database dependencies with Formal Concept Analysis.

Database Dependencies and Formal Concept Analysis

Abstract

This is an account of the characterization of database dependencies with Formal Concept Analysis.
Paper Structure (3 sections, 7 theorems, 5 equations, 1 table)

This paper contains 3 sections, 7 theorems, 5 equations, 1 table.

Table of Contents

  1. Introduction
  2. Functional Dependencies
  3. Multivalued Dependencies

Key Result

Proposition 2.1

Let $DB = (T,\mathcal{U})$ be a database, and let $\hbox{\Large$\wp$}_2(T)$ the set of sets of two tuples of $DB$. A functional dependency $X \rightarrow Y$ holds in $DB$ if and only if the implication $X \rightarrow Y$ holds in the context where

Theorems & Definitions (13)

  • Proposition 2.1: Proposition 28 in DBLP:books/daglib/0095956
  • Definition 2.1
  • Proposition 2.2: Proposition 3 in Baixeries2014AMAI
  • Proposition 3.1: Proposition 3 in Baixeries2005ICCS
  • Definition 3.1
  • Definition 3.2
  • Proposition 3.2
  • Proposition 3.3
  • Theorem 3.4: Theorem 1 in Baixeries2005ICCS
  • Definition 3.3
  • ...and 3 more