Synchronous Parallel Database Transformations
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.
KeywordsAbstract State Machine database transformation bounded exploration synchronous parallelism
Unable to display preview. Download preview PDF.
- 4.Grädel, E., Gurevich, Y.: Metafinite model theory. Information and Computation 140(1) (1998)Google Scholar
- 9.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)Google Scholar
- 10.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)Google Scholar