Query Stability in Data-aware Business Processes: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Tomas Masopust (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
Irina Dragoste (Diskussion | Beiträge) Keine Bearbeitungszusammenfassung |
||
Zeile 14: | Zeile 14: | ||
|Vortragender=Werner Nutt | |Vortragender=Werner Nutt | ||
|Forschungsgruppe=Computational Logic | |Forschungsgruppe=Computational Logic | ||
|Event series=KBS Seminar | |||
|In News anzeigen=1 | |In News anzeigen=1 | ||
}} | }} |
Aktuelle Version vom 18. Oktober 2018, 04:25 Uhr
Query Stability in Data-aware Business Processes
Vortrag von Werner Nutt
- Veranstaltungsort: APB 3027
- Beginn: 7. Dezember 2016 um 14:50
- Ende: 7. Dezember 2016 um 15:50
- Forschungsgruppe: Computational Logic
- Event series: KBS Seminar
- iCal
Organizations continuously accumulate data, often according to some business processes. If one poses a query over such data for decision support, it is important to know whether the query is stable, that is, whether the answers will stay the same or may change in the future because business processes may add further data.
We investigate query stability for conjunctive queries. To this end, we define a formalism that combines an explicit representation of the control flow of a process with a specification of how data is read and inserted into the database. We consider different restrictions of the process model and the state of the system, such as negation in conditions, cyclic executions, read access to written data, presence of pending process instances, and the possibility to start fresh process instances. We identify for which combinations of restrictions stability of conjunctive queries is decidable and provide encodings into variants of Datalog that are optimal with respect to the worst-case complexity of the problem.