Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Infinitary logic and inductive definability over finite structures
Information and Computation
On the expressive power of Datalog: tools and a case study
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Queries and algorithms computable by polynomial time existential reflective machines
Fundamenta Informaticae
The Kolmogorov expressive power of Boolean query languages
Theoretical Computer Science - Special issue: database theory
WSQ/DSQ: a practical approach for combined querying of databases and the Web
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Fine Hierarchies of Generic Computation
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Inductive Definability with Counting on Finite Structures
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Preservation Theorems in Finite Model Theory
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Database Interrogation Using Conjunctive Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
| Hi-index | 0.00 |
We consider a model of querying remote databases, in which we compute results of queries not supported by the database system, by using sequences of supported queries and analysing locally their results. We study the expressiveness of this model of computation, as well as its complexity, measured in terms of the number of queries used.