Technical Reports (CIS)

Document Type

Technical Report

Date of this Version

6-1-2010

Comments

University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-12-19.

Abstract

We develop a compact and efficient reachability labeling scheme for answering provenance queries on workflow runs that conform to a given specification. Even though a workflow run can be structurally more complex and can be arbitrarily larger than the specification due to fork (parallel) and loop executions, we show that a compact reachability labeling for a run can be efficiently computed using the fact that it originates from a fixed specification. Our labeling scheme is optimal in the sense that it uses labels of logarithmic length, runs in linear time, and answers any reachability query in constant time. Our approach is based on using the reachability labeling for the specification as an effective skeleton for designing the reachability labeling for workflow runs. We also demonstrate empirically the effectiveness of our skeleton-based labeling approach.

Keywords

Workflow Provenance, Reachability Labeling

Share

COinS
 

Date Posted: 22 December 2011

This document has been peer reviewed.