Fixpoint extensions of first-order logic and datalog-like languages
Proceedings of the Fourth Annual Symposium on Logic in computer science
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Procedural languages for database queries and updates
Journal of Computer and System Sciences
Infinitary logics and 0–1 laws
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
The expressive power of complex values in object-based data models
Information and Computation
Evolving algebras 1993: Lipari guide
Specification and validation methods
On the completeness of object-creating database transformation languages
Journal of the ACM (JACM)
Catching the boat with Strudel: experiences with a Web-site management system
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Object identity as a query language primitive
Journal of the ACM (JACM)
Procedural and declarative database update languages
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Yuri, logic, and computer science
Fields of logic and computation
Fields of logic and computation
| Hi-index | 0.00 |
Abstract state machines (ASMs) form a relatively new computation model holding the promise that they can simulate any computational system in lockstep. In particular, an instance of the ASM model has recently been introduced for computing queries to relational databases. This model, to which we refer as the BGS model, provides a powerful query language in which all computable queries can be expressed. In this paper, we show that when one is only interested in polynomial-time computations, BGS is strictly more powerful than both QL and whilenew, two well-known computationally complete query languages. We then show that when a language such as whilenew is extended with a duplicate elimination mechanism, polynomial-time simulations between the language and BGS become possible.