anchor.diff:  
   .Example query 2:
   
  -Given a database containing two nodes, and the following query,
  -the sequence below describes a non-obvious query execution.
  +Given a database containing two nodes, and the following query, the sequence below describes a non-obvious query execution.
   
   [source,cypher]
   ----
  
positive.code: toc::[]
  
  === Background
  Cypher allows queries to go through multiple steps, and it’s possible to interleave reading and writing to the graph.
  Some clauses can also do both - read the graph and write to it at the same time.
  
  To allow the user to understand what the outcome will be at an abstract, logical level, semantics for the visibility of these changes should be clear.
  
negative.code: ----
  
  |===
  | Query       | Pre-existing nodes  | Rows in  | Nodes created  | Rows out
  | `MATCH ()`  | 2                   | 1        | 0              | 2 (N)
  | `CREATE ()` | 2                   | 2        | 2 \(R)         | 2
  | `WITH *`    | 4                   | 2        | 0              | 2
  | `MATCH ()`  | 4                   | 2        | 0              | 8 (N * R)
  | `CREATE ()` | 4                   | 8        | 8              | 8
  | _Outcome_   | *12 (2 + 2 + 8)*    | -        | *10*           | *8*
  |===
  
  .Example query 3:
  In the following query, the `MATCH` following the `UNION` will find the nodes created before the `UNION`.
  
  [source,cypher]
  ----
  