For this week, I continued to work on implementing\u00a0queries by defining some generic queries, e.g.:\u00a0for each sink node Y, compute all source nodes X that are in the lineage of Y\u00a0similar: for each output node, compute all input nodes on which the output depends. Then I practiced\u00a0more sophisticated\u00a0queries such as are the outputs that do NOT depend on ALL inputs? or queries for LCA (Lowest common ancestor) problems: for two given data products X and Y, determine the node(s) that are \u201clowest\u201d common ancestors of X and Y (\u201cmost recent common ancestor\u201d).<\/p>\n
Additionally, \u00a0I also exploited noWorkflow which uses abstract syntax tree (AST) analysis, reflection, and profiling, to collect provenance without the need of a version control system and enable scientists to avoid using naming conventions to store files originated in previous executions. After that I tried some examples in\u00a0noWorkflow, then started investigating some queries in this model.<\/p>\n
Next week, I will discuss more about Yin-Yang which combining YW( allowing the user to define a wf model implicit in a script) & NW (capturing retrospective provenance from Python scripts).<\/p>\n","protected":false},"excerpt":{"rendered":"
For this week, I continued to work on implementing\u00a0queries by defining some generic queries, e.g.:\u00a0for each sink node Y, compute all source nodes X that are in the lineage of Y\u00a0similar: for each output node, compute all input nodes on which the output depends. Then I practiced\u00a0more sophisticated\u00a0queries such as Continue reading Week 3: Reproducibility of Script-Based Workflows<\/span>