Synchronous Parallel Database Transformations

  • Klaus-Dieter Schewe
  • Qing Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7153)

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.

Keywords

Abstract State Machine database transformation bounded exploration synchronous parallelism 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)MATHGoogle Scholar
  2. 2.
    Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. ACM Transactions on Computational Logic 4(4), 578–651 (2003)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Börger, E., Stärk, R.: Abstract State Machines. Springer, Heidelberg (2003)CrossRefMATHGoogle Scholar
  4. 4.
    Grädel, E., Gurevich, Y.: Metafinite model theory. Information and Computation 140(1) (1998)Google Scholar
  5. 5.
    Gurevich, Y., Tillmann, N.: Partial updates. Theoretical Computer Science 336(2-3), 311–342 (2005)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Transactions on Computational Logic 1(1), 77–111 (2000)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Schewe, K.-D., Wang, Q.: A customised ASM thesis for database transformations. Acta Cybernetica 19(4), 765–805 (2010)MathSciNetMATHGoogle Scholar
  8. 8.
    Schewe, K.-D., Wang, Q.: XML database transformations. Journal of Universal Computer Science 16(20), 3043–3072 (2010)MATHGoogle Scholar
  9. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Klaus-Dieter Schewe
    • 1
    • 2
  • Qing Wang
    • 3
  1. 1.Software Competence Center HagenbergLinzAustria
  2. 2.Johannes-Kepler-UniversityLinzAustria
  3. 3.Department of Information ScienceUniversity of OtagoNew Zealand

Personalised recommendations