Linear Constraint Query Languages: Expressive Power and Complexity
نویسندگان
چکیده
We give an AC upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressibility of various usual queries, such as the parity of the cardinality of a set or the connectivity of a graph in rst-order logic with linear constraints.
منابع مشابه
The Expressivity of Constraint Query Languages with Boolean Algebra Linear Cardinality Constraints
Constraint query languages with Boolean algebra linear cardinality constraints were introduced recently and shown to be evaluable using a quantifier elimination method in [22]. However, the expressive power of constraint query languages with linear cardinality constraints is still poorly understood in comparison with other cases of constraint query languages. This paper makes several contributi...
متن کاملQueries with Arithmetical Constraints
This paper is dedicated to Paris Kanellakis who initiated the eld of constraint databases, and deeply innuenced our work. Abstract In this paper, we study the expressive power and the complexity of rst-order logic with arithmetic, as a query language over relational and constraint databases. We rst consider the data complexity of rst-order queries. We prove in particular that linear queries can...
متن کاملCombining Relational Algebra, SQL, and Constraint Programming
The goal of this paper is to provide a strong interaction between constraint programming and relational DBMSs. To this end we propose extensions of standard query languages such as relational algebra (RA) and sql, by adding constraint solving capabilities to them. In particular, we propose non-deterministic extensions of both languages, which are specially suited for combinatorial problems. Non...
متن کاملFirst-Order Languages Expressing Constructible Spatial Database Queries
The research presented in this paper is situated in the framework of constraint databases that was introduced by Kanellakis, Kuper, and Revesz in their seminal paper of 1990. Constraint databases and query languages are defined using real polynomial constraints. As a consequence of a classical result by Tarski, first-order queries in the constraint database model are effectively computable, and...
متن کاملComplexity and Expressive Power of Ontology-Mediated Queries (Invited Talk)
Data sets that have been collected from multiple sources or extracted from the web or often highly incomplete and heterogeneous, which makes them hard to process and query. One way to address this challenge is to use ontologies, which provide a way to assign a semantics to the data, to enrich it with domain knowledge, and to provide an enriched and uniform vocabulary for querying. The combinati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994