ReGraDa: Reactive Graph Data - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

ReGraDa: Reactive Graph Data

Résumé

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.
Fichier principal
Vignette du fichier
509400_1_En_12_Chapter.pdf (791.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03387831 , version 1 (20-10-2021)

Licence

Paternité

Identifiants

Citer

Leandro Galrinho, João Costa Seco, Søren Debois, Thomas Hildebrandt, Håkon Norman, et al.. ReGraDa: Reactive Graph Data. 23th International Conference on Coordination Languages and Models (COORDINATION), Jun 2021, Valletta, Malta. pp.188-205, ⟨10.1007/978-3-030-78142-2_12⟩. ⟨hal-03387831⟩
58 Consultations
16 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More