Labeling recursive workflow executions on-the-fly

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2011, Pages 493-504

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

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

dynamic labeling scheme; reachability query; recursive workflow

Indexed keywords

DYNAMIC LABELING; DYNAMIC LABELING SCHEMES; LABELING SCHEME; LABELINGS; LONG LINEAR; REACHABILITY QUERIES; RECURSIONS; RECURSIVE WORKFLOW; WORK-FLOWS; WORKFLOW EXECUTION;

DATABASE SYSTEMS;

EID: 79960004112     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989375     Document Type: Conference Paper

References (22)

1. R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. In SIGMOD Conference, pages 253-262, 1989.
2. S. Alstrup, P. Bille, and T. Rauhe. Labeling schemes for small distances in trees. In SODA, pages 689-698, 2003.
3. S. Alstrup and T. Rauhe. Improved labeling scheme for ancestor queries. In SODA, pages 947-953, 2002.
4. I. Altintas, C. Berkley, E. Jaeger, M. B. Jones, B. Ludäscher, and S. Mock. Kepler: An extensible system for design and execution of scientific workflows. In SSDBM, pages 423-424, 2004.
5. 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.
6. S. P. Callahan, J. Freire, E. Santos, C. E. Scheidegger, C. T. Silva, and H. T. Vo. Vistrails: visualization meets data management. In SIGMOD Conference, pages 745-747, 2006.
7. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937-946, 2002.
8. E. Cohen, H. Kaplan, and T. Milo. Labeling dynamic xml trees. In PODS, pages 271-281, 2002.
9. 2) barrier. In FOCS, pages 381-389, 2000.
10. P. Fraigniaud and A. Korman. Compact ancestry labeling schemes for xml trees. In SODA, pages 458-466, 2010.
11. T. Heinis and G. Alonso. Efficient lineage tracking for scientific workflows. In SIGMOD Conference, pages 1007-1018, 2008.
12. 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.
13. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558-598, 1990.
14. 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.
15. R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD Conference, pages 595-608, 2008.
16. H. Kaplan, T. Milo, and R. Shabo. A comparison of labeling schemes for ancestor queries. In SODA, pages 954-963, 2002.
17. V. King and G. Sagert. A fully dynamic algorithm for maintaining the transitive closure. In STOC, pages 492-498, 1999.
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. 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.
22. H. Yildirim, V. Chaoji, and M. J. Zaki. Grail: Scalable reachability index for large graphs. PVLDB, 3(1):276-284, 2010.