| Informatikai Tanszékcsoport>>> Oktatás>>> | In English |
Relational Databases and Homogeneity in Logics with Counting
José María Turull Torres
Abstract:
We define a new hierarchy in the class of computable queries to relational databases, in terms of the preservation of equality of theories in fragments of first order logic with bounded number of variables with the addition of counting quantifiers (). We prove that the hierarchy is strict, and it turns out that it is orthogonal to the TIME-SPACE hierarchy defined with respect to the Turing machine complexity. We introduce a model of computation of queries to characterize the different layers of our hierarchy which is based on the reflective relational machine of S. Abiteboul, C. Papadimitriou, and V. Vianu. In our model the databases are represented by their theories. Then we define and study several properties of databases related to homogeneity in getting various results on the change in the computation power of the introduced machine, when working on classes of databases with such properties. We study the relation between our hierarchy and a similar one which we defined in a previous work, in terms of the preservation of equality of theories in fragments of first order logic with bounded number of variables, but without counting quantifiers (). Finally, we give a characterization of the layers of the two hierarchies in terms of the infinitary logics and , respectively.Footnotes
... Torres Massey University, Department of Information Systems, Information Science Research Centre, PO Box 756, Wellington, New Zealand