Differencing provenance in scientific workflows

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 808-819

  Bao, Zhuowei ^a   Cohen Boulakia, Sarah ^a   Davidson, Susan B ^a   Eyal, Anat ^a   Khanna, Sanjeev ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRODUCTS; DIFFERENCING ALGORITHM; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; SCIENTIFIC WORKFLOW; SCIENTIFIC WORKFLOWS; SERIES-PARALLEL GRAPH; WORK-FLOWS; WORKFLOW SPECIFICATION;

COMPUTATIONAL COMPLEXITY; MANAGEMENT; WORK SIMPLIFICATION;

SPECIFICATIONS;

EID: 67649657677     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.103     Document Type: Conference Paper

References (21)

1. L. Moreau and B. Lud äscher, Eds., Concurrency and Computation: Practice & Experience, Special Issue on the First Provenance Challenge. Wiley, 2007, vol. 20. [Online]. Available: http://twiki.ipaw.info/bin/view/ Challenge/
2. "Business process execution language for web services." [Online]. Available: http://www.ibm.com/developerworks/library/specification/ wsbpel/
3. Z. Bao, S. Cohen-Boulakia, S. B. Davidson, A. Eyal, and S. Khanna, "Differencing provenance in scientific workflows," University of Pennsylvania, Tech. Rep. MS-CIS-08-04, 2008. [Online]. Available: http://db.cis.upenn.edu/
4. P. Wohed, W. M. P. van der Aalst, M. Dumas, and A. H. M. ter Hofstede, "Analysis of web services composition languages: The case of bpel4ws," in ER, 2003, pp. 200 -215.
5. K.-C. Tai, "The tree-to-tree correction problem," J. ACM, vol. 26, no. 3, pp. 422 -433, 1979.
6. R. A. Wagner and M. J. Fischer, "The string-to-string correction problem," J. ACM, vol. 21, no. 1, pp. 168 -173, 1974.
7. K. Zhang and D. Shasha, "Simple fast algorithms for the editing distance between trees and related problems," SIAM J. Comput., vol. 18, no. 6, pp. 1245 -1262, 1989.
8. S. M. Selkow, "The tree-to-tree editing problem," Inf. Process. Lett., vol. 6, no. 6, pp. 184 -186, 1977.
9. Y. Wang, D. J. DeWitt, and J. yi Cai, "An effective change detection algorithm for xml documents," in ICDE, 2003, pp. 519 -530.
10. S. S. Chawathe, A. Rajaraman, H. Garcia-Molina, and J. Widom, "Change detection in hierarchically structured information," in SIGMOD, 1996, pp. 493 -504.
11. S. S. Chawathe and H. Garcia-Molina, "Meaningful change detection in structured data," in SIGMOD, 1997, pp. 26 -37.
12. K. Zhang, R. Statman, and D. Shasha, "On the editing distance between unordered labeled trees," Inf. Process. Lett., vol. 42, no. 3, pp. 133 -139, 1992.
13. K. Zhang, "A constrained edit distance between unordered labeled trees," Algorithmica, vol. 15, no. 3, pp. 205 -222, 1996.
14. A. K. A. de Medeiros, W. M. P. van der Aalst, and A. J. M. M. Weijters, "Quantifying process equivalence based on observed behavior," Data Knowl. Eng., vol. 64, no. 1, pp. 55 -74, 2008.
15. W. M. P. van der Aalst, A. K. A. de Medeiros, and A. J. M. M. Weijters, "Process equivalence: Comparing two process models based on observed behavior," in Business Process Management, 2006, pp. 129 -144.
16. J. Freire, C. T. Silva, S. P. Callahan, E. Santos, C. E. Scheidegger, and H. T. Vo, "Managing rapidly-evolving scientific workflows," in IPAW, 2006, pp. 10 -18.
17. C. E. Scheidegger, H. T. Vo, D. Koop, J. Freire, and C. T. Silva, "Querying and creating visualizations by analogy," IEEE Transactions on Visualization and Computer Graphics, vol. 13, no. 6, pp. 1560 -1567, 2007.
18. J. Cheriyan, T. Jordán, and R. Ravi, "On 2-coverings and 2-packings of laminar families," in ESA, 1999, pp. 510 -520.
19. J. Valdes, R. E. Tarjan, and E. L. Lawler, "The recognition of series parallel digraphs," in STOC, 1979, pp. 1 -12.
20. H. W. Kuhn, "The hungarian method for the assignemnt problem," Naval Research Logistics Quarterly, no. 2, pp. 83 -97, 1955.
21. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. MIT Press adnd McGraw-Hill, 2001.