An optimal labeling scheme for workflow provenance using skeleton labels

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 711-722

  Bao, Zhuowei ^a   Davidson, Susan B ^a   Khanna, Sanjeev ^a   Roy, Sudeepa ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

labeling; provenance; reachability; workflow

Indexed keywords

CONSTANT TIME; LABELING SCHEME; LINEAR TIME; OPTIMAL LABELING; PROVENANCE; REACHABILITY; REACHABILITY QUERIES;

LABELS; OPTIMIZATION; SPECIFICATIONS;

MANAGEMENT;

EID: 77954749965     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807244     Document Type: Conference Paper

References (18)

1. S. Abiteboul, H. Kaplan, and T. Milo. Compact labeling schemes for ancestor queries. In SODA, pages 547-556, 2001.
2. 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.
3. S. Alstrup and T. Rauhe. Improved labeling scheme for ancestor queries. In SODA, pages 947-953, 2002.
4. A. Chapman, H. V. Jagadish, and P. Ramanan. Efficient provenance storage. In SIGMOD Conference, pages 993-1006, 2008.
5. L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on dags. In VLDB, pages 493-504, 2005.
6. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937-946, 2002.
7. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In STOC, pages 1-6, 1987.
8. T. Heinis and G. Alonso. Efficient lineage tracking for scientific workflows. In SIGMOD Conference, pages 1007-1018, 2008.
9. 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.
10. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558-598, 1990.
11. 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.
12. 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.
13. H. Kaplan, T. Milo, and R. Shabo. A comparison of labeling schemes for ancestor queries. In SODA, pages 954-963, 2002.
14. experiment virtual research environment for social sharing of workflows. Future Generation Comp. Syst., 25(5):561-567, 2009.
15. N. Santoro and R. Khatib. Labelling and implicit routing in networks. Comput. J., 28(1):5-8, 1985.
16. M. Thorup and U. Zwick. Compact routing schemes. In SPAA, pages 1-10, 2001.
17. S. Trißl and U. Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD Conference, pages 845-856, 2007.
18. H. Wang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE, page 75, 2006.