Some equalities in table algebras

Authors

  • V.N. Red’ko
  • D.B. Buy
  • A. S. Senchenko

DOI:

https://doi.org/10.15407/dopovidi2014.06.048

Keywords:

equalities, table algebras

Abstract

The necessary and sufficient conditions, due to which eleven inclusions realized in table algebras become equalities, are found. These conditions are expressed in terms of active domains of the tables and are natural.

Downloads

References

Codd E. F. A Communications of the ACM, 1970, 13, No. 6: 377–387. https://doi.org/10.1145/362384.362685

Redko V. N., Brona Yu. I., Buy D. B., Polyakov S. A. Relyatsiyni databases: tabular algebra and SQL-like language. Kyiv: Akadempeiodyka, 2001 (in Ukrainian).

Knuth D. E. The art of computer programming. Vol. 4, Fascicle 0. Introduction to combinatorial algorithms and Boolean functions. Upper Saddle River: Addison-Wesley Professional, 2008.

Mendenkovich N. A., Kuznetsov S. D. Tr. ISP RAN, 2012, 23: 195–214 (in Russian).

Kuratovsky K. Topology. Vol. 1. Moscow: Mir, 1966 (in Russian).

Meyer D. Theory of relational databases. Moscow: Mir, 1987 (in Russian).

Konnoli T., Begg K. Database. Design, implementation and maintenance. Theory and practice. Moscow: Vilyams, 2003 (in Russian).

Downloads

Published

26.02.2025

How to Cite

Red’ko, V., Buy, D., & Senchenko, A. S. (2025). Some equalities in table algebras . Reports of the National Academy of Sciences of Ukraine, (6), 48–52. https://doi.org/10.15407/dopovidi2014.06.048

Issue

No. 6 (2014): Reports of the National Academy of Sciences of Ukraine

Section

Information Science and Cybernetics

License

Copyright (c) 2025 Reports of the National Academy of Sciences of Ukraine

Creative Commons License

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