About relationship between table algebra of infinite tables and multiset table algebra

I.M. Glushko

Abstract


This article is a continuation of the works devoted to the actual problem of the development of the theoretical basis of the table databases. The question of the relationship between table algebra of infinite tables and multiset table algebra is considered. Considering the fact that 1-multisets are analogues of ordinary sets, the question arises, is whether table algebra of infinite tables a subalgebra of multiset table algebra. This paper is devoted to this issue. Applying the theorem-plural and logical-algebraic methods found that this is not the case. The table algebra of infinite tables does not form subalgebra of multiset table algebra, since it is not closed in relation to some signature operations of multiset table algebra. These operations are determined.

Problems in programming 2018; 2-3: 158-163 


Keywords


relation databases; table algebra of infinite tables; multiset table algebra

Full Text:

PDF (Ukrainian)

References


REDKO, V.N. et al. (2001) Relational Databases: Table Algebras and SQL-like Language. Kyiv: Publishing house Academperiodica.

BUY, D.B & GLUSHKO, I.M. (2016) Calculi and extensions of table algebras signature. Nizhyn: NDU im. M. Gogol.

BOGATYREVA, J.A. (2011) Multisets theory and its applications. A Thesis Submitted of the Requirements of the Kyiv National Taras

Shevchenko University for the Degree of Doctor of Philosophy. Location: Kyiv National Taras Shevchenko University.

CUTLAND, N. (1983) Computability. An introduction to recursive function theory. Moscow: Myr.


Refbacks

  • There are currently no refbacks.