用细粒度的重复标记工作流视图
Labeling Workflow Views with Fine-Grained Dependencies
摘要：
本文认为，有效地回答可达性查询的起源图的意见，来自执行工作流，可能包括递归的问题。这些视图包括复合模块和模块输入与输出之间的细粒度依赖关系模型。一种新的视图自适应动态标记方案的开发，高效的查询评价，其中视图规范被静态标记（即，因为他们被创建）和数据项被动态标记，因为他们是在工作流执行过程中产生的。虽然细粒度的依赖关系和递归工作流的组合需要，在一般情况下，长（线性大小）的数据标签，我们表明，对于一个大的自然类的工作流和视图，标签是紧凑的（几何尺寸）和可达性查询可以在恒定的时间进行评估。实验结果表明，这种方法的好处超过国家的最先进的技术时，适用于标记多个视图。
英文摘要：
This paper considers the problem of efficiently answering reachability queries over views of provenance graphs, derived from executions of workflows that may include recursion. Such views include composite modules and model fine-grained dependencies between module inputs and outputs. A novel view-adaptive dynamic labeling scheme is developed for efficient query evaluation, in which view specifications are labeled statically (i.e. as they are created) and data items are labeled dynamically as they are produced during a workflow execution. Although the combination of fine-grained dependencies and recursive workflows entail, in general, long (linear-size) data labels, we show that for a large natural class of workflows and views, labels are compact (logarithmic-size) and reachability queries can be evaluated in constant time. Experimental results demonstrate the benefit of this approach over the state-of-the-art technique when applied for labeling multiple views.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
