ReGraDa: Reactive Graph Data

Autor: Søren Debois, Tijs Slaats, Leandro Galrinho, João Costa Seco, Thomas Hildebrandt, Håkon Norman
Přispěvatelé: Faculdade de Ciências e Tecnologia = School of Science & Technology (FCT NOVA), Universidade Nova de Lisboa = NOVA University Lisbon (NOVA), NOVA Laboratory for Computer Science and Informatics (NOVA-LINCS), Departamento de Informática (DI), Universidade Nova de Lisboa = NOVA University Lisbon (NOVA)-Universidade Nova de Lisboa = NOVA University Lisbon (NOVA)-Faculdade de Ciências e Tecnologia = School of Science & Technology (FCT NOVA), Universidade Nova de Lisboa = NOVA University Lisbon (NOVA)-Universidade Nova de Lisboa = NOVA University Lisbon (NOVA), DCR Solutions, University of Copenhagen = Københavns Universitet (KU), Ferruccio Damiani, Ornela Dardha, TC 6, WG 6.1
Rok vydání: 2021
Předmět:
Zdroj: Lecture Notes in Computer Science ISBN: 9783030781415
COORDINATION
Lecture Notes in Computer Science
23th International Conference on Coordination Languages and Models (COORDINATION)
23th International Conference on Coordination Languages and Models (COORDINATION), Jun 2021, Valletta, Malta. pp.188-205, ⟨10.1007/978-3-030-78142-2_12⟩
DOI: 10.1007/978-3-030-78142-2_12
Popis: Part 3: Large-Scale Decentalised Systems; International audience; 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.
Databáze: OpenAIRE