Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/2506
Title: Abstract state machines and computationally complete query languages
Authors: Blass, A
Gurevich, Y
VAN DEN BUSSCHE, Jan 
Issue Date: 2002
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCE
Source: INFORMATION AND COMPUTATION, 174(1). p. 20-36
Abstract: 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 while(new), two well-known computationally complete query languages. We then show that when a language such as while(new) is extended with a duplicate elimination mechanism, polynomial-time simulations between the language and BGS become possible. (C) 2002 Elsevier Science (USA).
Notes: Univ Michigan, Dept Math, Ann Arbor, MI 48109 USA. Microsoft Corp, Res, Redmond, WA 98052 USA. Limburgs Univ Ctr, B-3590 Diepenbeek, Belgium.Blass, A, Univ Michigan, Dept Math, Ann Arbor, MI 48109 USA.
Keywords: ASM; choiceless; polynomial time; database query; complete query language; QL; while
Document URI: http://hdl.handle.net/1942/2506
ISSN: 0890-5401
e-ISSN: 1090-2651
DOI: 10.1007/3-540-44518-8_3
ISI #: 000175514800002
Category: A1
Type: Journal Contribution
Validations: ecoom 2003
Appears in Collections:Research publications

Show full item record

SCOPUSTM   
Citations

6
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

6
checked on May 21, 2022

Page view(s)

42
checked on May 20, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.