Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Computable functions in tabular databases


We provide a formalization of data structures used in tabular databases. A tabular computable function is defined. A finite base of the algebra of computable tabular functions is constructed, using the operations multiply, branch, loop, and parallel execution.

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

Literature Cited

  1. 1.

    E. F. Codd, “A relational model for large shared data banks,” Commun. ACM,13, No. 16, 377–387 (1970).

  2. 2.

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

  3. 3.

    A. K. Chandra and D. Harel, “Structure and complexity of relational queries,” J. Comput. Syst. Sci.,25, No. 1, 99–128 (1982).

  4. 4.

    N. Immerman, “Relational queries computable in polynomial time,” Proc. 14th ACM Symp. Theor. Comput., San Antonio (1982), pp. 147–158.

  5. 5.

    M. Vardi, “Complexity of relational query languages,” Proc. 14th ACM Symp. Theor. Comput., San Antonio (1982), pp. 137–146.

  6. 6.

    A. B. Livchak, “On polynomial queries to relational databases,” Programmirovanie, No. 2, 66–72 (1985).

  7. 7.

    J. Martin, Computer Data-Base Organization, Prentice-Hall, Englewood Cliffs, N.J. (1975).

  8. 8.

    L. A. Kalinichenko, Methods and Tools for Integration of Inhomogeneous Databases [in Russian], Nauka, Moscow (1983).

  9. 9.

    A. Maggiolo-Schettini and J. Winkowski, “Towards a programming language for manipulating relational data bases,” Proc. IFIP Workshop Conf. Formal Descr. Program. Concepts-11, Garmisch-Parten (1982), pp. 265–286.

  10. 10.

    V. N. Red'ko, “Fundamentals of composition programming,” Programmirovanie, No. 5, 3–13 (1979).

  11. 11.

    V. N. Red'ko, “Semantic program structures,” Programmirovanie, No. 1, 3–19 (1981).

  12. 12.

    N. S. Nikitchenko, “Program compositions inducing monotone functions of a special kind,” Programmirovanie, No. 1, 3–16 (1987).

  13. 13.

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

  14. 14.

    G. Germano and A. Maggiolo-Schettini, “Computable stack functions for semantics of stack programs,” J. Comput. Syst. Sci,19, No. 2, 133–144 (1979).

  15. 15.

    G. Germano and A. Maggiolo-Schettini, “Sequence recursiveness without cylindrification and limited register machines,” Theor. Comput. Sci.,15, No. 2, 213–221 (1981).

  16. 16.

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

  17. 17.

    V. A. Uspenskii and A. A. Semenov, Theory of Algorithms: Fundamental Discoveries and Applications [in Russian], Nauka, Moscow (1987).

  18. 18.

    N. Cutland, Computability, An Introduction to Recursive Function Theory, Cambridge Univ. Press (1980).

  19. 19.

    I. D. Zaslavskii, “Graph-schemata with memory,” Tr. Mat. Inst. AN SSSR,16, No. 3, 99–192 (1964).

  20. 20.

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

Download references

Additional information

Translated from Kibernetika, No. 2, pp. 24–29, March–April, 1989.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Gubskii, B.V., Basarab, I.A. Computable functions in tabular databases. Cybern Syst Anal 25, 158–166 (1989).

Download citation


  • Operating System
  • Artificial Intelligence
  • Data Structure
  • System Theory
  • Computable Function