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
.
Queries with arithmetical constraints
1997
Theoretical Computer Science
In this paper, we study the expressive power and the complexity of first-order logic with arithmetic, as a query language over relational and constraint databases. We consider constraints over various domains (N, Z, Q, and W), and with various arithmetical operations ( <, +, x, etc.). We first consider the data complexity of first-order queries. We prove in particular that linear queries can be evaluated in AC0 over finite integer databases, and in NC' over linear constraint databases. This
doi:10.1016/s0304-3975(96)00194-6
fatcat:2l24uv556reahd6xv2u57wxgqu