Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/2506
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBlass, A-
dc.contributor.authorGurevich, Y-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.date.accessioned2007-11-15T09:02:09Z-
dc.date.available2007-11-15T09:02:09Z-
dc.date.issued2002-
dc.identifier.citationINFORMATION AND COMPUTATION, 174(1). p. 20-36-
dc.identifier.issn0890-5401-
dc.identifier.urihttp://hdl.handle.net/1942/2506-
dc.description.abstractAbstract 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).-
dc.language.isoen-
dc.publisherACADEMIC PRESS INC ELSEVIER SCIENCE-
dc.subject.otherASM; choiceless; polynomial time; database query; complete query language; QL; while-
dc.titleAbstract state machines and computationally complete query languages-
dc.typeJournal Contribution-
dc.identifier.epage36-
dc.identifier.issue1-
dc.identifier.spage20-
dc.identifier.volume174-
local.format.pages17-
local.bibliographicCitation.jcatA1-
dc.description.notesUniv 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.-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcatA1-
dc.identifier.doi10.1007/3-540-44518-8_3-
dc.identifier.isi000175514800002-
item.fulltextNo Fulltext-
item.accessRightsClosed Access-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorGurevich, Y-
item.contributorBlass, A-
item.fullcitationBlass, A; Gurevich, Y & VAN DEN BUSSCHE, Jan (2002) Abstract state machines and computationally complete query languages. In: INFORMATION AND COMPUTATION, 174(1). p. 20-36.-
item.validationecoom 2003-
crisitem.journal.issn0890-5401-
crisitem.journal.eissn1090-2651-
Appears in Collections:Research publications
Show simple item record

SCOPUSTM   
Citations

6
checked on Sep 2, 2020

WEB OF SCIENCETM
Citations

6
checked on Jun 29, 2022

Page view(s)

44
checked on Jul 3, 2022

Google ScholarTM

Check

Altmetric


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