%0 Conference Paper %1 qlqp %A Bowers, Shawn %A Ludäscher, Bertram %B Current Trends in Database Technology – EDBT 2006 %D 2006 %K provenance scientific-workflows %P 712--723 %T A Calculus for Propagating Semantic Annotations Through Scientific Workflow Queries %U http://dx.doi.org/10.1007/11896548_54 %X Scientific workflows facilitate automation, reuse, and reproducibility of scientific data management and analysis tasks. Scientific workflows are often modeled as dataflow networks, chaining together processing components (called actors) that query, transform, analyse, and visualize scientific datasets. Semantic annotations relate data and actor schemas withconceptual information from a shared ontology, to support scientific workflow design, discovery, reuse, and validation inthe presence of thousands of potentially useful actors and datasets. However, the creation of semantic annotations is complexand time-consuming. We present a calculus and two inference algorithms to automatically propagate semantic annotations through workflow actors described by relational queries. Given an input annotation α and a query q, forward propagation computes an output annotation α′; conversely, backward propagation infers α from q and α′.

@inproceedings{qlqp, abstract = {Scientific workflows facilitate automation, reuse, and reproducibility of scientific data management and analysis tasks. Scientific workflows are often modeled as dataflow networks, chaining together processing components (called actors) that query, transform, analyse, and visualize scientific datasets. Semantic annotations relate data and actor schemas withconceptual information from a shared ontology, to support scientific workflow design, discovery, reuse, and validation inthe presence of thousands of potentially useful actors and datasets. However, the creation of semantic annotations is complexand time-consuming. We present a calculus and two inference algorithms to automatically propagate semantic annotations through workflow actors described by relational queries. Given an input annotation α and a query q, forward propagation computes an output annotation α′; conversely, backward propagation infers α from q and α′.}, added-at = {2009-09-05T13:39:10.000+0200}, author = {Bowers, Shawn and Lud{\"a}scher, Bertram}, biburl = {https://www.bibsonomy.org/bibtex/25353caadeb852156fd672209f2a6bcd7/hidders}, booktitle = {Current Trends in Database Technology – EDBT 2006}, description = {SpringerLink - Book Chapter}, interhash = {7c7ff94867a4595cb7c92393474266f2}, intrahash = {5353caadeb852156fd672209f2a6bcd7}, keywords = {provenance scientific-workflows}, pages = {712--723}, timestamp = {2009-09-05T13:39:10.000+0200}, title = {A Calculus for Propagating Semantic Annotations Through Scientific Workflow Queries}, url = {http://dx.doi.org/10.1007/11896548_54}, year = 2006 }