کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
426197 | 686009 | 2011 | 6 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Mapping attribution metadata to the Open Provenance Model Mapping attribution metadata to the Open Provenance Model](/preview/png/426197.png)
A description of a data item’s provenance can be provided in different forms, and which form is best depends on the intended use of that description. Because of this, different communities have made quite distinct underlying assumptions in their models for electronically representing provenance. Approaches deriving from the library and archiving communities emphasise agreed vocabulary by which resources can be described and, in particular, assert their attribution (who created the resource, who modified it, where it was stored, etc.) The primary purpose here is to provide intuitive metadata by which users can search for and index resources. In comparison, models for representing the results of scientific workflows have been developed with the assumption that each event or piece of intermediary data in a process’ execution can and should be documented, to give a full account of the experiment undertaken. These occurrences are connected together by stating where one derived from, triggered, or otherwise caused another, and so form a causal graph. Mapping between the two approaches would be beneficial in integrating systems and exploiting the strengths of each. In this paper, we specify such a mapping between Dublin Core and the Open Provenance Model. We further explain the technical issues to overcome and the rationale behind the approach, to allow the same method to apply in mapping similar schemes.
Research highlights
► Different models of provenance take different underlying assumptions.
► Mapping between provenance models allows the strengths of both to be exploited.
► We provide a mapping between Dublin Core and the Open Provenance Model.
Journal: Future Generation Computer Systems - Volume 27, Issue 6, June 2011, Pages 806–811