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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Börger, E., Stärk, R.: Abstract State Machines. Springer, Heidelberg (2003)
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)
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)
Doner, J.: Tree acceptors and some of their applications. Journal of Computer and Systems Science 4(5), 406–451 (1970)
Gurevich, J.: Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)
Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: Proceedings of WW 2007, pp. 1053–1062. ACM, New York (2007)
Schewe, K.-D., Wang, Q.: A customised ASM thesis for database transformations (2009) (submitted for publication)
Schewe, K.-D., Wang, Q.: XML database transformations (2009) (submitted for publication)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)