Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/694
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBlass, Andreas-
dc.contributor.authorGurevich, Yuri-
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.date.accessioned2005-03-24T11:24:02Z-
dc.date.available2005-03-24T11:24:02Z-
dc.date.issued2000-
dc.identifier.citationProceedings of the International Workshop on Abstract State Machines, Theory and Applications. p. 22-33-
dc.identifier.isbn3-540-67959-6-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/1942/694-
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 ${{\it while}_{\it new}}$, two well-known computationally complete query languages. We then show that when a language such as ${{\it while}_{\it new}}$ is extended with a duplicate elimination mechanism, polynomial-time simulations between the language and BGS become possible.-
dc.language.isoen-
dc.publisherSpringer-Verlag-
dc.relation.ispartofseriesLecture Notes In Computer Science-
dc.titleAbstract State Machines and Computationally Complete Query Languages-
dc.typeJournal Contribution-
local.bibliographicCitation.conferencenameProceedings of the International Workshop on Abstract State Machines, Theory and Applications-
dc.identifier.epage33-
dc.identifier.spage22-
local.bibliographicCitation.jcatA1-
local.type.refereedRefereed-
local.type.specifiedArticle-
local.relation.ispartofseriesnr1912-
dc.bibliographicCitation.oldjcatA2-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorBlass, Andreas-
item.contributorGurevich, Yuri-
item.fulltextNo Fulltext-
item.fullcitationBlass, Andreas; Gurevich, Yuri & VAN DEN BUSSCHE, Jan (2000) Abstract State Machines and Computationally Complete Query Languages. In: Proceedings of the International Workshop on Abstract State Machines, Theory and Applications. p. 22-33.-
item.accessRightsClosed Access-
Appears in Collections:Research publications
Show simple item record

Page view(s)

54
checked on Jun 28, 2022

Google ScholarTM

Check

Altmetric


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