Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved labeling scheme for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Labeling schemes for small distances in trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Kepler: An Extensible System for Design and Execution of Scientific Workflows
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
VisTrails: visualization meets data management
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Efficient lineage tracking for scientific workflows
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Future Generation Computer Systems
DDE: from dewey to a fully dynamic XML labeling scheme
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
An optimal labeling scheme for workflow provenance using skeleton labels
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Compact ancestry labeling schemes for XML trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
GRAIL: scalable reachability index for large graphs
Proceedings of the VLDB Endowment
Labeling workflow views with fine-grained dependencies
Proceedings of the VLDB Endowment
Search and result presentation in scientific workflow repositories
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Hi-index | 0.00 |
This paper presents a compact labeling scheme for answering reachability queries over workflow executions. In contrast to previous work, our scheme allows nodes (processes and data) in the execution graph to be labeled on-the-fly, i.e., in a dynamic fashion. In this way, reachability queries can be answered as soon as the relevant data is produced. We first show that, in general, for workflows that contain recursion, dynamic labeling of executions requires long (linear-size) labels. Fortunately, most real-life scientific workflows are linear recursive, and for this natural class we show that dynamic, yet compact (logarithmic-size) labeling is possible. Moreover, our scheme labels the executions in linear time, and answers any reachability query in constant time. We also show that linear recursive workflows are, in some sense, the largest class of workflows that allow compact, dynamic labeling schemes. Interestingly, the empirical evaluation, performed over both real and synthetic workflows, shows that our proposed dynamic scheme outperforms the state-of-the-art static scheme for large executions, and creates labels that are shorter by a factor of almost 3.