A Formal Context for Acyclic Join Dependencies

Baixeries, Jaume

doi:10.1007/978-3-319-60438-1_55

Cited by 4 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Here we continue this line of work, and present a characterization of AHG's that is build upon and generalizes previous results for SD's in [5], and also, complements the semantical characterization for AJD's presented in [6].…”

Section: Previous Worksupporting

confidence: 65%

“…Horn Clauses / Implications [27], [7] Functional Dependencies [11], [2], [13], [30] [20], [24], [26], [22] Armstrong Dependencies Similarity Dependencies [12], [16] MVD Clauses [3] Degenerated MVD [8] [4], [5], [23], [25] Symmetric Dependencies Multivalued Dependencies [9] Acyclic Join Dependencies [6] this paper Acyclic Hypergraphs In this paper, we present the characterization of the axioms for AJD's in terms of FCA. This work complements that in [6], where a characterization of the AJD's that hold in a dataset (also in terms of FCA) was provided, and generalizes that in [4] and in [5], that presents a characterization of the axioms for MVD's, which are, as we previously mentioned, a special case of AJD's. Table 1 also shows the blank that this paper tries to fill.…”

Section: Semantical Syntacticalmentioning

confidence: 99%

“…The semantical characterization of different Symmetric Dependencies has been presented in [8] for Degenerated Multivalued Dependencies, in [9] for MVD's and in [3] Multivalued Dependency Clauses. Finally, [6] presents a characterization of AJD's.…”

Section: Previous Workmentioning

confidence: 99%

See 2 more Smart Citations

A Formal Context for Closures of Acyclic Hypergraphs

Baixeries

2019

Formal Concept Analysis

Self Cite

View full text Add to dashboard Cite

Database constraints in the relational database model (RDBM) can be viewed as a set of rules that apply to a dataset, or as a set of axioms that can generate a (closed) set of those constraints. In this paper, we use Formal Concept Analysis to characterize the axioms of Acyclic Hypergraphs (in the RDBM they are called Acyclic Join Dependencies). This present paper complements and generalizes previous work on FCA and databases constraints.

show abstract

Section: Previous Worksupporting

confidence: 65%

Section: Semantical Syntacticalmentioning

confidence: 99%

See 1 more Smart Citation

A Formal Context for Closures of Acyclic Hypergraphs

Baixeries

2019

Formal Concept Analysis

Self Cite

View full text Add to dashboard Cite

show abstract

“…Исследование ациклических зависимостей продолжено в работе [17]. Представлен формальный контекст для зависимостей соединения, который обобщает подход для анализа многозначных зависимостей.…”

Section: связанные работыunclassified

A Generalization of the Inference Rules for Join Dependencies in Databases

Зыкин¹

2020

Model. anal. inf. sist.

View full text Add to dashboard Cite

In this paper a generalisation of the inference rules of the join dependencies that are used in the design of database schemas that meets the requirements of the h normal form is considered. In the previous works devoted to this problem, a empts to construct systems of the axioms of such dependencies based on inference rules are made. However, while the justi cation for the consistency (soundness) of the obtained axioms does not cause di culties, the proof of completeness in general has not been satisfactorily resolved. First of all, this is due to the limitations of the inference rules themselves.is work focuses on two original axiom systems presented in the works of Sciore and Malvestuto. For the inclusion dependencies a system of rules that generalises existing systems and has fewer restrictions has been obtained. e paper presents a proof of the derivability of known systems of axioms from the presented inference rules. In addition, evidence of the consistency (soundness) of these rules is provided. e question of the completeness of the formal system based on the presented rules did not nd a positive solution. In conclusion, the theoretical and practical signi cance of the inference rules for the join dependencies is noted.

show abstract