Synchronous parallel database transformations

Klaus Dieter Schewe; Qing Wang

doi:10.1007/978-3-642-28472-4_21

Synchronous parallel database transformations

Klaus Dieter Schewe^*, Qing Wang

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Citations (Scopus)

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 language	English
Title of host publication	Foundations of Information and Knowledge Systems - 7th International Symposium, FoIKS 2012, Proceedings
Pages	370-383
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-642-28472-4_21
Publication status	Published - 2012
Externally published	Yes
Event	7th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2012 - Kiel, Germany Duration: 5 Mar 2012 → 9 Mar 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7153 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2012
Country/Territory	Germany
City	Kiel
Period	5/03/12 → 9/03/12

Access to Document

10.1007/978-3-642-28472-4_21

Cite this

Schewe, K. D., & Wang, Q. (2012). Synchronous parallel database transformations. In Foundations of Information and Knowledge Systems - 7th International Symposium, FoIKS 2012, Proceedings (pp. 370-383). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7153 LNCS). https://doi.org/10.1007/978-3-642-28472-4_21

@inproceedings{63b1c9ad1a674ed19ef389d5cf3b9ebf,

title = "Synchronous parallel database transformations",

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, bounded exploration, database transformation, synchronous parallelism",

author = "Schewe, {Klaus Dieter} and Qing Wang",

year = "2012",

doi = "10.1007/978-3-642-28472-4_21",

language = "English",

isbn = "9783642284717",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "370--383",

booktitle = "Foundations of Information and Knowledge Systems - 7th International Symposium, FoIKS 2012, Proceedings",

note = "7th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2012 ; Conference date: 05-03-2012 Through 09-03-2012",

}

Schewe, KD & Wang, Q 2012, Synchronous parallel database transformations. in Foundations of Information and Knowledge Systems - 7th International Symposium, FoIKS 2012, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7153 LNCS, pp. 370-383, 7th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2012, Kiel, Germany, 5/03/12. https://doi.org/10.1007/978-3-642-28472-4_21

Synchronous parallel database transformations. / Schewe, Klaus Dieter; Wang, Qing.
Foundations of Information and Knowledge Systems - 7th International Symposium, FoIKS 2012, Proceedings. 2012. p. 370-383 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7153 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Synchronous parallel database transformations

AU - Schewe, Klaus Dieter

AU - Wang, Qing

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Abstract State Machine

KW - bounded exploration

KW - database transformation

KW - synchronous parallelism

UR - http://www.scopus.com/inward/record.url?scp=84863268609&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-28472-4_21

DO - 10.1007/978-3-642-28472-4_21

M3 - Conference contribution

SN - 9783642284717

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 370

EP - 383

BT - Foundations of Information and Knowledge Systems - 7th International Symposium, FoIKS 2012, Proceedings

T2 - 7th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2012

Y2 - 5 March 2012 through 9 March 2012

ER -

Synchronous parallel database transformations

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this