On the preservation of keys in the table algebras
DOI:
https://doi.org/10.15407/dopovidi2015.04.029Keywords:
keys, preservation, table algebrasAbstract
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.
Downloads
References
Codd E. F. Communications of the ACM, 1970, 13, No 6: 377–387. https://doi.org/10.1145/362384.362685
Redko V. N., Bui D. B. Kibernetika i sistem. analiz. 1996, 4: 3–12 (in Russian).
Konnoli T., Behh K. Database. Design, implementation and maintenance. Theory and practice, Moscow: Williams, 2003 (in Russian).
Deit C. J. Introduction to database systems. Moscow: Williams, 2005 (in Russian).
Kuratovski K. Topology Vol. 1, Moscow: Mir, 1966 (in Russian).
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).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Reports of the National Academy of Sciences of Ukraine

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

