Nevertheless, the advent of the sequential Abstract State Machine (ASM) thesis capturing sequential algorithms sheds light on the study of database transformations. Observing that the class of computations described by database transformations may be formalised as algorithms respecting database principles, we propose the database ASM thesis for a complete characterisation of database transformations. It turns out that every database transformation characterised by five postulates can be behaviourally simulated by a database Abstract State Machine (DB-ASM) with the same signature and background, and vice versa. Furthermore, a logic for DB-ASMs is defined. In spite of bounded non-determinism permitted by DB-ASMs, the logic is proven to be sound and complete.
*You can purchase the eBook (PDF) alone or combined with the printed book (eBundle). In both cases we use the payment service of PayPal for charging you - nevertheless it is not necessary to have a PayPal-account. With purchasing the eBook or eBundle you accept our licence for eBooks.