C&SA | Contents

Volume 58 >>> № 1 JANUARY — FEBRUARY 2022

-->

UDC 004.75

A.V. Anisimov¹, I.O. Zavadskiy², P.P. Kuliabko³

¹ Taras Shevchenko National University of Kyiv,
Kyiv, Ukraine

avatatan@gmail.com

² Taras Shevchenko National University of Kyiv,
Kyiv, Ukraine

ihorza@gmail.com

³ Taras Shevchenko National University of Kyiv,
Kyiv, Ukraine

kpp1@ukr.net

EXTENSION OF THE RELATIONAL ALGEBRA ON THE BASIS
OF DBTG CODASYL PROPOSALS

Abstract. The problem of low computational efficiency of the relational algebra is investigated. A certain extension of the relational algebra with the help of operations over data sets (the basic construction of DBTG CODASYL propositions) is proposed. The user is given a choice to implement the links between data, depending on the requirements for their processing speed, a slow but flexible option based on symbolic addressing (which is typical for relational databases) or fast but hard on direct pointers (relative addressing), which is typical for DBMS of the pre-relational era.

Keywords: relational approach, relational algebra, DBTG CODASYL proposals, data sets, Dribas selective algebra.

FULL TEXT

REFERENCES

Codd E.F. A relational model of data for large shared data banks. Communications of the ACM. 1970. Vol. 13, N 6. P. 377–387. https://dl.acm.org/doi/10.1145/362384.362685.

Dribas V.P. Relational database models [in Russian]. Minsk: BSU Publishing House, 1982. 192 p.

Date C.J. An introduction to database systems. 8th ed [Russian translation]. Moscow: Publishing House "Williams", 2005. 1328 p.

Olle T.W. The CODASYL approach to data base management. NY: John Wiley&Sons, 1978. 281 p.

CODASYL Database Task Group Report. NY: ACM, 1971. 487 p.

Chen P.P. The Entity-Relationship model — Toward a unified view of data. ACM Trans. Database Systems. 1976. Vol. 1, N 1. P. 9–36.

UDC 004.75

EXTENSION OF THE RELATIONAL ALGEBRA ON THE BASIS OF DBTG CODASYL PROPOSALS

REFERENCES

EXTENSION OF THE RELATIONAL ALGEBRA ON THE BASIS
OF DBTG CODASYL PROPOSALS