A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Relational Databases and Homogeneity in Logics with Counting
[chapter]
2002
Lecture Notes in Computer Science
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 (C k ). 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
doi:10.1007/3-540-45758-5_14
fatcat:as25cqvchzcuraegjgckqhxrla