Abstract
A solution to the problem of low computational efficiency of the relational data model is investigated. An extension of the relational algebra with the help of operations over data sets, i.e., the basic construction of CODASYL DBTG proposals, is suggested. A user is able to choose a method for implementing data links depending on the following requirements for their processing speed: a slow but flexible option based on symbolic addressing typical of relational DBMSs, or a fast but hard option based on direct pointers (relative addressing) typical of DBMSs of the pre-relational era.
Similar content being viewed by others
References
E. F. Codd, “A relational model of data for large shared data banks,” Communications of the ACM, Vol. 13, No. 6, 377–387 (1970). https://doi.org/10.1145/362384.362685.
V. P. Dribas, Relational Database Models [in Russian], Izd-vo BGU, Minsk (1982).
C. J. Date, An Introduction to Database Systems, Pearson, Boston (2004).
T. W. Olle, The CODASYL Approach to Data Base Management, John Wiley&Sons, New York (1978).
CODASYL Data Base Task Group, April 1971 Report, ACM, New York (1971).
P. P. Chen, “The entity-relationship model — Toward a unified view of data,” ACM Trans. Database Systems, Vol. 1, No. 1, 9–36 (1976).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetyka ta Systemnyi Analiz, No. 1, January–February, 2022, pp. 170–180.
Rights and permissions
About this article
Cite this article
Anisimov, A.V., Zavadskiy, I.O. & Kuliabko, P.P. Extension of the Relational Algebra on the Basis of CODASYL DBTG Proposals. Cybern Syst Anal 58, 148–156 (2022). https://doi.org/10.1007/s10559-022-00444-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-022-00444-3