Skip to main content
SpringerLink
Log in

Manipulation aspect of databases: The composition approach

  • Published:
Cybernetics Aims and scope

Abstract

Database manipulations are formalized as denotate-preserving functions. The main issues considered are the synthesis of manipulation operations and the construction of a universal kernel of data-manipulation languages.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature Cited

  1. I. A. Basarab and V. N. Red'ko, “Databases from logical-functional viewpoint,” Programmirovanie, No. 2, 53–67 (1984).

    Google Scholar 

  2. V. N. Red'ko and I. A. Basarab, Databases and Information Systems [in Russian], Znanie, Moscow (1987).

    Google Scholar 

  3. E. F. Codd, “Extending the database relational model to capture more meaning,” ACM Trans. Database Syst.,4, No. 4, 397–434 (1979).

    Google Scholar 

  4. Yu. L. Ershov and E. A. Palyutin, Mathematical Logic [in Russian], Nauka, Moscow (1979).

    Google Scholar 

  5. D. B. Bui, B. V. Gubskii, and V. N. Red'ko, “Completeness problems in classes of computable named functions,” Kibernetika, No. 4, 58–65 (1988).

    Google Scholar 

  6. G. Birkhoff, Lattice Theory, AMS, New York (1948).

    Google Scholar 

  7. K. Kuratowski and A. Mostowski, Theory of Sets [Russian translation], Mir, Moscow (1970).

    Google Scholar 

  8. V. Yu. Sazonov, “Bounded set theory, polynomial-time computability, and Δ-programming,” in: Applied Aspects of Mathematical Logic, No. 122, Computing Systems [in Russian], Novosibirsk (1987), pp. 110–132.

  9. V. Yu. Sazonov, “Polynomial-time computability in terms of inherited-finite sets with attributes,” Proc. 2nd All-Union Conf. on Applied Logic [in Russian], Novosibirsk (1988), pp. 205–207.

  10. A. B. Livchak, “Polynomial queries for databases,” Programmirovanie, No. 2, 66–72 (1985).

    Google Scholar 

  11. A. K. Chandra and D. Harel, “Computable queries for relational data bases,” J. Comput. Syst. Sci.,21, 156–178 (1981).

    Google Scholar 

  12. A. I. Mal'tsev, “Constructive algebras, I,” Usp. Mat. Nauk,16, No. 3, 3–60 (1961).

    Google Scholar 

  13. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  14. D. B. Bui and I. V. Red'ko, “Primitive program algebras of computable functions,” Kibernetika, No. 3, 68–74 (1987).

    Google Scholar 

  15. D. B. Bui and I. V. Red'ko, “Primitive program algebras of denotate-preserving functions,” Dokl. Akad. Nauk UkrSSR, Ser. A, No. 9, 66–68 (1988).

    Google Scholar 

Download references

Authors
  1. V. N. Red'ko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. B. Bui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. P. Zagorskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 6, pp. 105–113, November–December, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Red'ko, V.N., Bui, D.B. & Zagorskii, S.P. Manipulation aspect of databases: The composition approach. Cybern Syst Anal 25, 833–843 (1989). https://doi.org/10.1007/BF01069791

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation