Abstract
The DB-ASM thesis states that every database transformation can be expressed by a variant of Abstract State Machines. These machines permit unbounded parallelism only on the finite database part of a state. This paper generalises this work by permitting unbounded parallelism on the algorithmic part of the state as well. The “parallel DB-ASM”-thesis results from combining Gurevich’s parallel ASM thesis with the DB-ASM thesis. In doing so, it turns out that the postulates for synchronous parallel database transformations can be significantly simplified compared with the seminal work of Gurevich. The key idea is to generalise the notion of bounded exploration witnesses allowing them to include special non-ground terms.
This is a preview of subscription content, log in via an institution to check access.
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
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)
Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. ACM Transactions on Computational Logic 4(4), 578–651 (2003)
Börger, E., Stärk, R.: Abstract State Machines. Springer, Heidelberg (2003)
Grädel, E., Gurevich, Y.: Metafinite model theory. Information and Computation 140(1) (1998)
Gurevich, Y., Tillmann, N.: Partial updates. Theoretical Computer Science 336(2-3), 311–342 (2005)
Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)
Schewe, K.-D., Wang, Q.: A customised ASM thesis for database transformations. Acta Cybernetica 19(4), 765–805 (2010)
Schewe, K.-D., Wang, Q.: XML database transformations. Journal of Universal Computer Science 16(20), 3043–3072 (2010)
Schewe, K.-D., Wang, Q.: Partial updates in complex-value databases. In: Heimbürger, A., et al. (eds.) Information and Knowledge Bases XXII. Frontiers in Artificial Intelligence and Applications, vol. 225, pp. 37–56. IOS Press (2011)
Wang, Q.: A Proof System with Bounded Non-determinism in Database Transformations. In: Schewe, K.D., Thalheim, B. (eds.) SDKB 2010. LNCS, vol. 6834, pp. 114–133. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schewe, KD., Wang, Q. (2012). Synchronous Parallel Database Transformations. In: Lukasiewicz, T., Sali, A. (eds) Foundations of Information and Knowledge Systems. FoIKS 2012. Lecture Notes in Computer Science, vol 7153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28472-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-28472-4_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28471-7
Online ISBN: 978-3-642-28472-4
eBook Packages: Computer ScienceComputer Science (R0)