Matches in Nanopublications for { ?s ?p ?o <http://purl.org/np/RAiU32PD08aWTXnI8o4vIyOJebCp2KZaRYhbvli5JGEnI#assertion>. }
Showing items 1 to 2 of
2
with 100 items per page.
- paragraph type Paragraph assertion.
- paragraph hasContent "Proof. In the Find stage, a microtask is generated when the number of triples within task exceeds the threshold α. Since in this stage each microtask groups triples by subjects, then l the number of microtaks m i ,p,o)∈T }| per subject is given by |{(p,o)|(s α , where {(p, o)|(s i , p, o) ∈ T } corresponds to triples with sub- ject s i . In total, in the Find stage, l the exact number m of P i ,p,o)∈T }| microtasks generated is s i ∈S |{(p,o)|(s α , which is less than |T | (for α >1). In the Verify stage, each microtask groups RDF triples with the same quality issue. When considering β as the maximum number of triples contained within a microtask, then the number l of microtasks created per quality issue m |{t|t∈T ∧ q i ∈ φ̇(t)}| . Therefore, the exact q i ∈ Q is β number l of microtasks generated in the Verify stage is m P |{t|t∈T ∧ q i ∈ φ̇(t)}| , which is ≤ |T ||Q|. Con- q i ∈Q β sidering that the set Q is considerably smaller than T , we can affirm that the number of microtasks generated in the Verify stage is linear with respect to T ." assertion.