Skip to main content
Log in

A calculus for hierarchical data structures

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. F. I. Andon, V. G. Dovgopolyi, V. I. Konozenko, et al., “Principles of Oka data base management system,” Upr. Sist. Mash., No. 2, 32–35 (1977).

    Google Scholar 

  2. E. F. Codd, “A relational model of data for large shared data bases,” Comm. ACM,13, No. 6, 377–387, (1970).

    Google Scholar 

  3. V. A. Reznichenko, Languages of Relational Data Base Model [in Russian], No. 79-20, Preprint, Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR, Kiev (1979).

    Google Scholar 

  4. E. F. Codd, “Relational completeness of data base sublanguages,” in: Courant Comput. Sci. Symp. 6, Data Base Systems, New York (1971), pp. 33–64.

Download references

Authors

Additional information

Translated from Kibernetika, No. 6, pp. 13–17, November–December, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andon, F.I., Reznichenko, V.A. & Yashunin, A.E. A calculus for hierarchical data structures. Cybern Syst Anal 20, 785–790 (1984). https://doi.org/10.1007/BF01072163

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01072163

Keywords

Navigation