Standard
ReGraDa : Reactive Graph Data. / Galrinho, Leandro; Seco, João Costa; Debois, Søren; Hildebrandt, Thomas; Norman, Håkon; Slaats, Tijs.
Coordination Models and Languages - 23rd IFIP WG 6.1 International Conference, COORDINATION 2021, Held as Part of the 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021, Proceedings. ed. / Ferruccio Damiani; Ornela Dardha. Springer, 2021. p. 188-205 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12717 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Galrinho, L, Seco, JC, Debois, S
, Hildebrandt, T, Norman, H
& Slaats, T 2021,
ReGraDa: Reactive Graph Data. in F Damiani & O Dardha (eds),
Coordination Models and Languages - 23rd IFIP WG 6.1 International Conference, COORDINATION 2021, Held as Part of the 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021, Proceedings. Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12717 LNCS, pp. 188-205, 23rd IFIP WG 6.1 International Conference on Coordination Models and Languages, COORDINATION 2021 held as part of 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021, Virtual, Online,
14/06/2021.
https://doi.org/10.1007/978-3-030-78142-2_12APA
Galrinho, L., Seco, J. C., Debois, S.
, Hildebrandt, T., Norman, H.
, & Slaats, T. (2021).
ReGraDa: Reactive Graph Data. In F. Damiani, & O. Dardha (Eds.),
Coordination Models and Languages - 23rd IFIP WG 6.1 International Conference, COORDINATION 2021, Held as Part of the 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021, Proceedings (pp. 188-205). Springer. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 12717 LNCS
https://doi.org/10.1007/978-3-030-78142-2_12Vancouver
Galrinho L, Seco JC, Debois S
, Hildebrandt T, Norman H
, Slaats T.
ReGraDa: Reactive Graph Data. In Damiani F, Dardha O, editors, Coordination Models and Languages - 23rd IFIP WG 6.1 International Conference, COORDINATION 2021, Held as Part of the 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021, Proceedings. Springer. 2021. p. 188-205. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12717 LNCS).
https://doi.org/10.1007/978-3-030-78142-2_12Author
Galrinho, Leandro ; Seco, João Costa ; Debois, Søren ; Hildebrandt, Thomas ; Norman, Håkon ; Slaats, Tijs. / ReGraDa : Reactive Graph Data. Coordination Models and Languages - 23rd IFIP WG 6.1 International Conference, COORDINATION 2021, Held as Part of the 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021, Proceedings. editor / Ferruccio Damiani ; Ornela Dardha. Springer, 2021. pp. 188-205 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12717 LNCS).
Bibtex
@inproceedings{d153560154654e5399b06c93b4d183fa,
title = "ReGraDa: Reactive Graph Data",
abstract = "Business processes, data, and run-time control state are all key elements in the design of enterprise applications. However, the different layers for processes, data, and control are usually represented using different technologies that must be explicitly combined and kept in sync. We introduce ReGraDa, a process definition and programming language inspired by the declarative business process language Dynamic Condition Response Graphs and targeting the integrated description of business processes, data and run-time state as reactive graph data. ReGraDa processes compile directly to a data-centric graph-based system (neo4j/cypher), allowing for the database system to manage a process without the need for an external execution engine. The underlying graph structure allows for the definition of native data relations between data elements that subsumes the integrity guaranties of relational and the semi-structured data models. Graph relationships are also used to represent data-dependency and control-flow in the database. We present the reactive semantics of the language, a translation from ReGraDa to cypher, evaluate its performance, and briefly discuss future work and applications.",
author = "Leandro Galrinho and Seco, {Jo{\~a}o Costa} and S{\o}ren Debois and Thomas Hildebrandt and H{\aa}kon Norman and Tijs Slaats",
note = "Publisher Copyright: {\textcopyright} 2021, IFIP International Federation for Information Processing.; 23rd IFIP WG 6.1 International Conference on Coordination Models and Languages, COORDINATION 2021 held as part of 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021 ; Conference date: 14-06-2021 Through 18-06-2021",
year = "2021",
doi = "10.1007/978-3-030-78142-2_12",
language = "English",
isbn = "9783030781415",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "188--205",
editor = "Ferruccio Damiani and Ornela Dardha",
booktitle = "Coordination Models and Languages - 23rd IFIP WG 6.1 International Conference, COORDINATION 2021, Held as Part of the 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021, Proceedings",
address = "Switzerland",
}
RIS
TY - GEN
T1 - ReGraDa
T2 - 23rd IFIP WG 6.1 International Conference on Coordination Models and Languages, COORDINATION 2021 held as part of 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021
AU - Galrinho, Leandro
AU - Seco, João Costa
AU - Debois, Søren
AU - Hildebrandt, Thomas
AU - Norman, Håkon
AU - Slaats, Tijs
N1 - Publisher Copyright:
© 2021, IFIP International Federation for Information Processing.
PY - 2021
Y1 - 2021
N2 - Business processes, data, and run-time control state are all key elements in the design of enterprise applications. However, the different layers for processes, data, and control are usually represented using different technologies that must be explicitly combined and kept in sync. We introduce ReGraDa, a process definition and programming language inspired by the declarative business process language Dynamic Condition Response Graphs and targeting the integrated description of business processes, data and run-time state as reactive graph data. ReGraDa processes compile directly to a data-centric graph-based system (neo4j/cypher), allowing for the database system to manage a process without the need for an external execution engine. The underlying graph structure allows for the definition of native data relations between data elements that subsumes the integrity guaranties of relational and the semi-structured data models. Graph relationships are also used to represent data-dependency and control-flow in the database. We present the reactive semantics of the language, a translation from ReGraDa to cypher, evaluate its performance, and briefly discuss future work and applications.
AB - Business processes, data, and run-time control state are all key elements in the design of enterprise applications. However, the different layers for processes, data, and control are usually represented using different technologies that must be explicitly combined and kept in sync. We introduce ReGraDa, a process definition and programming language inspired by the declarative business process language Dynamic Condition Response Graphs and targeting the integrated description of business processes, data and run-time state as reactive graph data. ReGraDa processes compile directly to a data-centric graph-based system (neo4j/cypher), allowing for the database system to manage a process without the need for an external execution engine. The underlying graph structure allows for the definition of native data relations between data elements that subsumes the integrity guaranties of relational and the semi-structured data models. Graph relationships are also used to represent data-dependency and control-flow in the database. We present the reactive semantics of the language, a translation from ReGraDa to cypher, evaluate its performance, and briefly discuss future work and applications.
U2 - 10.1007/978-3-030-78142-2_12
DO - 10.1007/978-3-030-78142-2_12
M3 - Article in proceedings
AN - SCOPUS:85111359056
SN - 9783030781415
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 188
EP - 205
BT - Coordination Models and Languages - 23rd IFIP WG 6.1 International Conference, COORDINATION 2021, Held as Part of the 16th International Federated Conference on Distributed Computing Techniques, DisCoTec 2021, Proceedings
A2 - Damiani, Ferruccio
A2 - Dardha, Ornela
PB - Springer
Y2 - 14 June 2021 through 18 June 2021
ER -
