Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5833))

Included in the following conference series:

  • 738 Accesses

Abstract

In order to capture the dynamics of XML databases a general model of tree-based database transformations is required. In this paper such an abstract computational model is presented, which brings together ideas from Abstract State Machines and monadic second-order logic. The model captures all XML database transformations.

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

Access this chapter

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. Blass, A., Gurevich, Y.: Background, reserve, and gandy machines. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 1–17. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Börger, E., Stärk, R.: Abstract State Machines. Springer, Heidelberg (2003)

    Book  Google Scholar 

  3. Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6(1-6), 66–92 (1960)

    Article  MATH  Google Scholar 

  4. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata (release, October 2007)

  5. Doner, J.: Tree acceptors and some of their applications. Journal of Computer and Systems Science 4(5), 406–451 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gurevich, J.: Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)

    Article  MathSciNet  Google Scholar 

  7. Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: Proceedings of WW 2007, pp. 1053–1062. ACM, New York (2007)

    Google Scholar 

  8. Schewe, K.-D., Wang, Q.: A customised ASM thesis for database transformations (2009) (submitted for publication)

    Google Scholar 

  9. Schewe, K.-D., Wang, Q.: XML database transformations (2009) (submitted for publication)

    Google Scholar 

  10. Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. MST 2(1), 57–81 (1968)

    MathSciNet  Google Scholar 

  11. Van Den Bussche, J., Van Gucht, D., Andries, M., Gyssens, M.: On the completeness of object-creating database transformation languages. J. ACM 44(2), 272–319 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  12. Wang, Q., Schewe, K.-D.: Towards a logic for abstract metafinite state machines. In: Hartmann, S., Kern-Isberner, G. (eds.) FoIKS 2008. LNCS, vol. 4932, pp. 365–380. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Q., Ferrarotti, F.A. (2009). XML Machines. In: Heuser, C.A., Pernul, G. (eds) Advances in Conceptual Modeling - Challenging Perspectives. ER 2009. Lecture Notes in Computer Science, vol 5833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04947-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04947-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04946-0

  • Online ISBN: 978-3-642-04947-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics