Labeling workflow views with fine-grained dependencies

Proceedings of the VLDB Endowment

Volumn 5, Issue 11, 2012, Pages 1208-1219

  Bao, Zhuowei ^a   Davidson, Susan B ^a   Milo, Tova ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE DYNAMICS; COMPOSITE MODULES; EFFICIENT QUERY EVALUATION; MULTIPLE VIEWS; REACHABILITY QUERIES; STATE-OF-THE-ART TECHNIQUES; WORKFLOW EXECUTION; WORKFLOW VIEWS;

EID: 84873122283     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2350229.2350240     Document Type: Article

References (24)

1. S. Alstrup and T. Rauhe. Improved labeling scheme for ancestor queries. In SODA, pages 947-953, 2002.
2. I. Altintas, C. Berkley, E. Jaeger, M. B. Jones, B. Lud̈ascher, and S. Mock. Kepler: An extensible system for design and execution of scientific workflows. In SSDBM, pages 423-424, 2004.
3. Y. Amsterdamer, D. Deutch, and V. Tannen. Provenance for aggregate queries. In PODS, pages 153-164, 2011.
4. Z. Bao, S. B. Davidson, S. Khanna, and S. Roy. An optimal labeling scheme for workflow provenance using skeleton labels. In SIGMOD Conference, pages 711-722, 2010.
5. Z. Bao, S. B. Davidson, and T. Milo. Labeling recursive workflow executions on-the-fly. In SIGMOD Conference, pages 493-504, 2011.
6. Z. Bao, S. B. Davidson, and T. Milo. Labeling workflow views with fine-grained dependencies. Technical Report MS-CIS-12-11, University of Pennsylvania, 2012.
7. C. Beeri, A. Eyal, S. Kamenkovich, and T. Milo. Querying business processes. In VLDB, pages 343-354, 2006.
8. O. Biton, S. C. Boulakia, S. B. Davidson, and C. S. Hara. Querying and managing provenance through user views in scientific workflows. In ICDE, pages 1072-1081, 2008.
9. E. Cohen, H. Kaplan, and T. Milo. Labeling dynamic XML trees. In PODS, pages 271-281, 2002.
10. S. B. Davidson, S. Khanna, S. Roy, J. Stoyanovich, V. Tannen, and Y. Chen. On provenance and privacy. In ICDT, pages 3-10, 2011.
11. C. Demetrescu and G. F. Italiano. Fully dynamic transitive closure: Breaking through the o(n2) barrier. In FOCS, pages 381-389, 2000.
12. W. Fan, C. Y. Chan, and M. N. Garofalakis. Secure XML querying with security views. In SIGMOD Conference, pages 587-598, 2004.
13. T. Heinis and G. Alonso. Efficient lineage tracking for scientific workflows. In SIGMOD Conference, pages 1007-1018, 2008.
14. D. Hull, K. Wolstencroft, R. Stevens, C. A. Goble, M. R. Pocock, P. Li, and T. Oinn. Taverna: a tool for building and running workflows of services. Nucleic Acids Research, 34(Web-Server-Issue):729-732, 2006.
15. R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 3-hop: a high-compression indexing scheme for reachability query. In SIGMOD Conference, pages 813-826, 2009.
16. V. King and G. Sagert. A fully dynamic algorithm for maintaining the transitive closure. In STOC, pages 492-498, 1999.
17. L. Moreau, J. Freire, J. Futrelle, R. E. McGrath, J. Myers, and P. Paulson. The Open Provenance Model: An overview. In IPAW, pages 323-326, 2008.
18. P. E. O'Neil, E. J. O'Neil, S. Pal, I. Cseri, G. Schaller, and N. Westbury. ORDPATHs: Insert-friendly XML node labels. In SIGMOD Conference, pages 903-908, 2004.
19. D. D. Roure, C. A. Goble, and R. Stevens. The design and realisation of the myExperiment Virtual Research Environment for social sharing of workflows. Future Generation Comp. Syst., 25(5):561-567, 2009.
20. N. Santoro and R. Khatib. Labelling and implicit routing in networks. Comput. J., 28(1):5-8, 1985.
21. P. Sun, Z. Liu, S. B. Davidson, and Y. Chen. Detecting and resolving unsound workflow views for correct provenance analysis. In SIGMOD Conference, pages 549-562, 2009.
22. S. J. van Schaik and O. de Moor. A memory efficient reachability data structure through bit vector compression. In SIGMOD Conference, pages 913-924, 2011.
23. L. Xu, T. W. Ling, H. Wu, and Z. Bao. DDE: from dewey to a fully dynamic XML labeling scheme. In SIGMOD Conference, pages 719-730, 2009.
24. H. Yildirim, V. Chaoji, and M. J. Zaki. GRAIL: Scalable reachability index for large graphs. PVLDB, 3(1):276-284, 2010.