Revised PROV-DICTIONARY in response to Paul's review (ISSUE-614)
authorTom De Nies <tom.denies@ugent.be>
Thu, 24 Jan 2013 15:57:22 +0100
changeset 5438 d4616b07870a
parent 5437 3b2f9e819fcf
child 5439 b4f582f6fde7
Revised PROV-DICTIONARY in response to Paul's review (ISSUE-614)
dictionary/prov-dictionary.html
--- a/dictionary/prov-dictionary.html	Thu Jan 24 15:39:18 2013 +0100
+++ b/dictionary/prov-dictionary.html	Thu Jan 24 15:57:22 2013 +0100
@@ -719,7 +719,7 @@
 <p>
 Provenance is information about entities, activities, and people
 involved in producing a piece of data or thing, which can be used to
-form assessments about its quality, reliability or trustworthiness.
+form assessments about its quality, reliability or trustworthiness. This document describes extensions to PROV to facilitate the modeling of provenance for dictionary data structures.
 </p>
 
 <p>The  <a href="http://www.w3.org/TR/2012/WD-prov-overview-20121211/">PROV Document Overview</a> describes the overall state of PROV, and should be read before other PROV documents.</p>
@@ -792,7 +792,9 @@
 
 <span class="glossary-ref" data-ref="glossary-dictionary"></span>
 
-<p>Conceptually, a dictionary has a logical structure consisting of key-entity pairs. This structure is often referred to as a <em>map</em>, and is a generic indexing mechanism that can abstract commonly used data structures, including associative lists, relational tables, ordered lists, and more. The specification of such specialized structures in terms of key-value pairs is out of the scope of this document.</p>
+<p>Conceptually, a dictionary has a logical structure consisting of key-value pairs. This structure is often referred to as a <em>map</em>, and is a generic indexing mechanism that can abstract commonly used data structures, including associative lists, relational tables, ordered lists, and more.
+	This document provides a mechanism to assert the provenance for these types of data structures, in the most general way, as a collection of key-value pairs, modified through insertions and deletions. Any more specialized structures can be modeled to some extent in terms of these key-value pairs. 
+	Here, we will discuss the provenance of dictionaries structured in terms of key-value pairs. However, how this key-value pair structure is translated to more specialized data structures, is beyond the scope of this document.</p>
 
 <p>For the purpose of provenance, a dictionary entity is viewed as a snapshot of a dictionary data structure, following a sequence of state-changing insertion and removal operations. These  operations result in new snapshots, each snapshot forming an identifiable dictionary entity. Thus, when the structure of a dictionary changes (through insertions or removals), a new dictionary entity is defined, whereas the older dictionary entity remains the same.</p>