From e630b05a8964d13342d2a472885607c2e39b0c6c Mon Sep 17 00:00:00 2001
From: Olaf Hartig We define eval(|D|(|G|), |A|, μctx) as the evaluation of an algebraic query expression |A| with
respect to a dataset |D| having active graph |G|
- in correlation with solution mapping μctx.
- The active graph is initially the default
- graph of |D|. Further symbols used in the following definitions are:Algebraic Syntax
is an algebraic query expression.
Translate Graph Patterns
Let FS := the empty set
-Let G := the empty pattern, a basic graph pattern which is the empty set.
+Let G := ContextMapping
For each element E in the sequence of elements in the GroupGraphPattern
@@ -10656,9 +10659,10 @@
Sample
Evaluation Semantics
The active graph is initially the default graph of |D| and + μctx is initially the empty solution mapping μ0.
+Further symbols used in the following definitions are:
eval( |D|(|G|), Path(|X|, |path|, |Y|), μctx ) = multiset of solution mappings
See section Property Path Patterns
+Definition: Evaluation of ContextMapping
+eval( |D|(|G|), ContextMapping, μctx ) = multiset that contains only μctx, with a multiplicity of 1
+Definition: Evaluation of Filter
eval( |D|(|G|), Filter(|F|, |P|), μctx ) = Filter( |F|, eval(|D|(|G|), |P|, μctx), |D|, |G| )
From 6d1490604240883f8398c40611c514e3dbacf577 Mon Sep 17 00:00:00 2001 From: Olaf HartigLet FS := the empty set -Let G := ContextMapping +Let G := ContextSolution For each element E in the sequence of elements in the GroupGraphPattern @@ -10684,8 +10684,8 @@Evaluation Semantics
See section Property Path Patterns
Definition: Evaluation of ContextMapping
-eval( |D|(|G|), ContextMapping, μctx ) = multiset that contains only μctx, with a multiplicity of 1
+Definition: Evaluation of ContextSolution
+eval( |D|(|G|), ContextSolution, μctx ) = multiset that contains only μctx, with a multiplicity of 1
Definition: Evaluation of Filter