Skip to main content
SpringerLink
Log in

Abstract State Machines and Computationally Complete Query Languages

  • Conference paper
  • First Online:
Abstract State Machines - Theory and Applications (ASM 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1912))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

    Google Scholar 

  2. S. Abiteboul and P.C. Kanellakis. Object identity as a query language primitive. Journal of the ACM, 45(5):798–842, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  3. S. Abiteboul and V. Vianu. Procedural and declarative database update languages. In Proceedings 7th ACM Symposium on Principles of Database Systems, pages 240–250, 1988.

    Google Scholar 

  4. S. Abiteboul and V. Vianu. Fixpoint extensions of first-order logic and Datalog-like languages. In Proceedings Fourth Annual Symposium on Logic in Computer Science, pages 71–79. IEEE Computer Society Press, 1989.

    Google Scholar 

  5. S. Abiteboul and V. Vianu. Procedural languages for database queries and updates. Journal of Computer and System Sciences, 41(2):181–229, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  6. S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proceedings 23rd ACM Symposium on the Theory of Computing, pages 209–219, 1991.

    Google Scholar 

  7. A. Blass, Y. Gurevich, and S. Shelah. Choiceless polynomial time. Annals of Pure and Applied Logic. To appear; also available from [7].

    Google Scholar 

  8. A. Chandra and D. Harel. Computable queries for relational data bases. Journal of Computer and System Sciences, 21(2):156–178, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  9. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.

    Google Scholar 

  10. H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Undergraduate Texts in Mathematics. Springer-Verlag, 1984.

    MATH  Google Scholar 

  11. M. Fernández, D. Florescu, J. Kang, A. Levy, and D. Suciu. Catching the boat with Strudel: Experiences with a Web-site management system. SIGMOD Record, 27(2):414–425, 1998. Proceedings ACM SIGMOD International Conference on Management of Data.

    Google Scholar 

  12. Y. Gurevich. Evolving algebras: An attempt to discover semantics. Bulletin of the European Association for Theoretical Computer Science, 43:264–284, 1991.

    Google Scholar 

  13. Y. Gurevich. Evolving algebra 1993: Lipari guide. In E. Börger, editor, Specification and Validation Methods, pages 9–36. Oxford University Press, 1995.

    Google Scholar 

  14. Y. Gurevich. May 1997 draft of the ASM guide. Technical Report CSE-TR-336-97, University of Michigan, EECS Department, 1997.

    Google Scholar 

  15. P. Halmos. Naive Set Theory. Van Nostrand Reinhold, 1960.

    Google Scholar 

  16. P.G. Kolaitis and M.Y. Vardi. Infinitary logics and 0-1 laws. Information and Computation, 98(2):258–294, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  17. J. Van den Bussche and J. Paredaens. The expressive power of complex values in object-based data models. Information and Computation, 120:220–236, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  18. J. Van den Bussche, D. Van Gucht, M. Andries, and M. Gyssens. On the comple-teness of object-creating database transformation languages. Journal of the ACM, 44(2):272–319, 1997.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Michigan, USA

    Andreas Blass

  2. Microsoft Research and University of Michigan, USA

    Yuri Gurevich

  3. Limburg University, Belgium

    Jan Van den Bussche

Authors
  1. Andreas Blass
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuri Gurevich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Van den Bussche
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA

    Yuri Gurevich

  2. ETH Zürich, Institute TIK Gloriastr., 35, 8092, Zürich, Switzerland

    Philipp W. Kutter

  3. EPFL Lausanne, DI IN-Ecublens, 1015, Lausanne, Switzerland

    Martin Odersky

  4. ETH Zürich, Institute TIK Gloriastr., 35, 8092, Zürich, Switzerland

    Lothar Thiele

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blass, A., Gurevich, Y., Bussche, J.V.d. (2000). Abstract State Machines and Computationally Complete Query Languages. In: Gurevich, Y., Kutter, P.W., Odersky, M., Thiele, L. (eds) Abstract State Machines - Theory and Applications. ASM 2000. Lecture Notes in Computer Science, vol 1912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44518-8_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-44518-8_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67959-2

  • Online ISBN: 978-3-540-44518-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation