On the preservation of keys in the table algebras

TitleOn the preservation of keys in the table algebras
Publication TypeJournal Article
Year of Publication2015
AuthorsSenchenko, AS
Abbreviated Key TitleDopov. Nac. akad. nauk Ukr.
DOI10.15407/dopovidi2015.04.029
Issue4
SectionInformation Science and Cybernetics
Pagination29-34
Date Published4/2015
LanguageRussian
Abstract

The problem of preservation of keys, including simple keys, by the signature operations of table algebras is investigated. It is shown that the operations of intersection, difference, selection, join, and division of tables preserve the keys and do not preserve the simple keys, whereas the operations of projection and renaming preserve both. The necessary and sufficient conditions, under which the operation of active supplement preserves the key, are found.

Keywordskeys, preservation, table algebras
References: 

1. Codd E. F. Communications of the ACM, 1970, 13, No 6: 377–387. https://doi.org/10.1145/362384.362685
2. Redko V. N., Bui D. B. Kibernetika i sistem. analiz. 1996, 4: 3–12 (in Russian).
3. Konnoli T., Behh K. Database. Design, implementation and maintenance. Theory and practice, Moscow: Williams, 2003 (in Russian).
4. Deit C. J. Introduction to database systems. Moscow: Williams, 2005 (in Russian).
5. Kuratovski K. Topology Vol. 1, Moscow: Mir, 1966 (in Russian).
6. Redko V.N., Brona Y.I., Bui D.B, Polyakov S.A. Relational databases: tabular algebra and SQL-like languages, Kyiv: Akademperiodyka, 2001 (in Ukrainian).