Наукові видання каф-ри інформатики та інформаційних технологій
Постійне посилання зібранняhttps://dspace.cusu.edu.ua/handle/123456789/140
Переглянути
3 результатів
collection.search.results.head
Документ Completeness of armstrong's axiomatic(2011) Buy, Dmitriy; Puzikova, Anna; Буй, Дмитро Борисович; Пузікова, Анна Валентинівна(en) This paper presents a rigorous and convincing proof that Armstrong’s axiomatic system (as the foundation of relational database normalization theory) is complete and sound within the paradigm of mathematical logic: the relations of syntactic and semantic entailment are introduced and it is shown that they coincide. The properties of set-theoretic data structure functional constraints have been used as mathematical framework.Документ Axiomatics for Multivalued Dependencies in Table Databases: Correctness, Completeness, Completeness Criteria(2015) Bui, Dmitriy; Puzikova, Anna; Буй, Дмитро Борисович; Пузікова, Анна Валентинівна(en) Axiomatics for multivalued dependencies in table databases and axiomatics for functional and multivalued dependencies are reviewed; the completeness of these axiomatics is established in terms of coincidence of syntactic and semantic consequence relations; the completeness criteria for these axiomatic systems are formulated in terms of cardinalities (1) of the universal domain D , which is considering in interpretations, and (2) the scheme R, which is a parameter of all constructions, because only the tables which attributes belong to this scheme R are considering. The results obtained in this paper and developed mathematical technique can be used for algorithmic support of normalization in table databases.Документ Axiomatics for multivalued dependencies in table databases: correctness and completeness(Institut of Mathematics and Computer Science, 2015) Bui, Dmitriy; Puzikova, Anna; Пузікова, Анна Валентинівна; Буй, Дмитро Борисович(en) Axiomatics for multivalued dependencies in table databases and axiomatics for functional and multivalued dependencies are reviewed. For each axiomatic relations of syntactic and semantic succession are considered. A rigorous and convincing proof of correctness and completeness of these axiomatics (within the paradigm of mathematical logic) is established. In particular, the properties of closures of sets of specified dependencies are investigated. The properties of set-theoretic function restriction have been used as mathematical framework.