Synchronous Parallel Database Transformations

  • Klaus-Dieter Schewe
  • , Qing Wang

Research output: Chapter in Book/Report/Conference proceedingConference proceedingspeer-review

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.
Original languageEnglish
Title of host publicationFoundations of Information and Knowledge Systems (FoIKS 2012)
PublisherSpringer Berlin Heidelberg
Pages371-384
Number of pages14
Volume7153
Publication statusPublished - 2012

Publication series

NameLecture Notes in Computer Science (LNCS)

Fields of science

  • 102 Computer Sciences
  • 102001 Artificial intelligence

JKU Focus areas

  • Computation in Informatics and Mathematics

Cite this