Abstract—
The article investigates the safety of unary inflationary fixed point operators (IFP-operators), i.e., their computability in finitely many steps. Such operators correspond exactly to recursive SQL queries. Therefore, the problem under investigation is directly related to database theory. The problem arises from the fact that if recursion and universe relations, e.g., addition, are simultaneously used in a SQL query, then a query evaluation can fall into an infinite loop. Moreover, such a combination makes it possible to model a universal computing device, e.g., a Turing machine. Hence, the problem of finite computability for such SQL queries is undecidable. In our previous works, we established some properties of a universe those guarantee the finite computability of any IFP-operator in the universe. In this article, we investigate a connection between an arity of IFP-operators and their safety. The main result of this article is that some results for general IFP-operators do not hold for unary ones. An instance of a universe is constructed in which all unnested unary IFP-operators are safe. However, there are unsafe binary IFP-operators in this universe. Therefore, IFP-operators can become unsafe if the arity changes. In addition, there are unsafe nested unary operators. This contrasts with the general case in which this is impossible. There are also elementary equivalent universes where the same unary IFP-operators are unsafe. This behavior is also different from the behavior of general IFP-operators.
Similar content being viewed by others
REFERENCES
Codd, E.F., Relational completeness of data base sublanguages, in Database Systems, Rustin, R., Ed., Prentice-Hall, 1972, pp. 33–64.
Dudakov S. M., On safety of recursive queries, Vestn. Tversk. Gos. Univ., Ser.: Prikl. Mat., 2012, no. 4, pp. 71–80.
Dudakov S.M., On safety of IFP-operators and recursive queries, Vestn. Tversk. Gos. Univ., Ser.: Prikl. Mat., 2013, no. 2, pp. 5–13.
Dudakov, S.M., On inflationary fix-point operators safety, Lobachevskii J. Math., 2015, vol. 36, no. 4, pp. 328–331.
Gurevich, Y. and Shelah, S., Fixed-point extensions of first-order logic, Ann. Pure Appl. Logic, 1986, vol. 32, pp. 265–280.
Kanellakis, P., Kuper, G., and Revesz, P., Constraint query languages, J. Comput. Syst. Sci., 1995, vol. 51, no. 1, pp. 26–52.
Marker, D., Model Theory: An Introduction, New York: Springer-Verlag, 2002.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Translated by O. Pismenov
About this article
Cite this article
Dudakov, S.M. On Safety of Unary and Nonunary IFP Operators. Aut. Control Comp. Sci. 53, 683–688 (2019). https://doi.org/10.3103/S0146411619070034
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411619070034