Collaborative data-driven workflows: think global, act local

Collaborative data-driven workflows: think global, act local
复制标题

数据驱动的协作工作流程:全球化思考,本地化行动

DOI:
--
复制
发表时间:
2013
期刊:
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
影响因子:
--
通讯作者:
V. Vianu
V. Vianu
中科院分区:
--
文献类型:
--
作者:
S. Abiteboul;V. Vianu

文献摘要

参考文献

被引文献

相似文献

我们介绍并研究了一个协同数据驱动的工作流模型。在局部视图样式中,每个对等点都有一个全局实例的局部视图,该视图保持纯虚拟状态。本地更新会对通过全局实例定义的其他对等方的数据产生副作用。我们还假设对等体提供了它们的规范(的抽象),这样每个对等体都可以实际看到整个系统的规范并进行推理。我们研究的能力,一个同行进行运行时推理的全球运行的系统,特别是其他同行的行动,根据自己的本地观察。一个主要的贡献是表明,在一个合理的限制(即,关键的可见性),可以构建一个有限的符号表示的无限集的全球运行与给定的本地观测一致。使用的符号表示,我们表明,我们可以在PSPACE评估一个大类的性能在全球运行,表示在一阶逻辑与过去的线性时间的时间运营商,PLTL-FO的扩展。我们还提供了一个变体的算法,允许增量监控静态定义的属性,然后开发一个扩展,允许监控共享相同的时间结构,动态定义的运行展开的属性的无限类。最后,我们考虑扩展的语言,允许工作流控制PLTL-FO公式。我们证明,这并没有增加的权力的工作流规范语言,从而表明,这种内省推理下的语言是封闭的。
We introduce and study a model of collaborative data-driven workflows. In a local-as-view style, each peer has a partial view of a global instance that remains purely virtual. Local updates have side effects on other peers' data, defined via the global instance. We also assume that the peers provide (an abstraction of) their specifications, so that each peer can actually see and reason on the specification of the entire system. We study the ability of a peer to carry out runtime reasoning about the global run of the system, and in particular about actions of other peers, based on its own local observations. A main contribution is to show that, under a reasonable restriction (namely, key-visibility), one can construct a finite symbolic representation of the infinite set of global runs consistent with given local observations. Using the symbolic representation, we show that we can evaluate in PSPACE a large class of properties over global runs, expressed in an extension of first-order logic with past linear-time temporal operators, PLTL-FO. We also provide a variant of the algorithm allowing to incrementally monitor a statically defined property, and then develop an extension allowing to monitor an infinite class of properties sharing the same temporal structure, defined dynamically as the run unfolds. Finally, we consider an extension of the language, that permits workflow control with PLTL-FO formulas. We prove that this does not increase the power of the workflow specification language, thereby showing that the language is closed under such introspective reasoning.
DOI: 10.1145/1860702.1860704
发表时间: 2010-09
期刊: SIGMOD Rec.
影响因子: --
作者:
J. Hellerstein
通讯作者: J. Hellerstein