limitations example updates

Author: JPryce-Aklundh

modules/ROOT/pages/patterns/shortest-paths.adoc

@@ -736,7 +736,7 @@ Consider the following query, which does not specify a unique target node and ge
 ----
 PROFILE
 MATCH p = ANY SHORTEST 
-  (start:N {trail: ["C", "C", "A", "C", "A", "B", "B", "B", "A"]})--+
+  (start:N {trail: ["C", "C", "A", "C", "A", "B", "B", "B", "A"]})--{2,}
   (end:N {level: 9})
 RETURN count(*) AS pathCount
 ----
@@ -759,22 +759,22 @@ Due to the existence of multiple target nodes without a specified, unique proper
 +-----------------------------------+----+------------------------------------------------------------------+----------------+-------+---------+----------------+------------------------+-----------+---------------+
 | Operator                          | Id | Details                                                          | Estimated Rows | Rows  | DB Hits | Memory (Bytes) | Page Cache Hits/Misses | Time (ms) | Pipeline      |
 +-----------------------------------+----+------------------------------------------------------------------+----------------+-------+---------+----------------+------------------------+-----------+---------------+
-| +ProduceResults                   |  0 | `count(*)`                                                       |              1 |     1 |       0 |              0 |                    0/0 |     0.015 |               |
+| +ProduceResults                   |  0 | pathCount                                                        |              1 |     1 |       0 |              0 |                    0/0 |     0.199 |               |
 | |                                 +----+------------------------------------------------------------------+----------------+-------+---------+----------------+------------------------+-----------+               |
-| +EagerAggregation                 |  1 | count(*) AS `count(*)`                                           |              1 |     1 |       0 |             40 |                    0/0 |     0.097 | In Pipeline 2 |
+| +EagerAggregation                 |  1 | count(*) AS pathCount                                            |              1 |     1 |       0 |             40 |                    0/0 |     2.975 | In Pipeline 2 |
 | |                                 +----+------------------------------------------------------------------+----------------+-------+---------+----------------+------------------------+-----------+---------------+
-| +StatefulShortestPath(All, Trail) |  2 | SHORTEST 1 (start) ((`anon_3`)-[`anon_4`]-(`anon_5`)){1, } (end) |           8052 | 19682 |  373974 |       81274328 |                65235/0 |   330.475 | In Pipeline 1 |
+| +StatefulShortestPath(All, Trail) |  2 | SHORTEST 1 (start) ((`anon_3`)-[`anon_4`]-(`anon_5`)){2, } (end) |           8052 | 19682 |  373982 |       82162292 |                65705/0 |   586.334 | In Pipeline 1 |
 | |                                 |    |         expanding from: start                                    |                |       |         |                |                        |           |               |
 | |                                 |    |     inlined predicates: end.level = $autoint_1                   |                |       |         |                |                        |           |               |
 | |                                 |    |                         end:N                                    |                |       |         |                |                        |           |               |
 | |                                 +----+------------------------------------------------------------------+----------------+-------+---------+----------------+------------------------+-----------+---------------+
-| +NodeUniqueIndexSeek              |  3 | UNIQUE start:N(trail) WHERE trail = $autolist_0                  |              1 |     1 |       2 |            376 |                    3/0 |     0.106 | In Pipeline 0 |
+| +NodeUniqueIndexSeek              |  3 | UNIQUE start:N(trail) WHERE trail = $autolist_0                  |              1 |     1 |       2 |            376 |                    3/0 |     0.232 | In Pipeline 0 |
 +-----------------------------------+----+------------------------------------------------------------------+----------------+-------+---------+----------------+------------------------+-----------+---------------+
 
-Total database accesses: 373976, total allocated memory: 81274688
+Total database accesses: 373984, total allocated memory: 82162652
 
 1 row
-ready to start consuming query after 40 ms, results consumed after another 331 ms
+ready to start consuming query after 83 ms, results consumed after another 592 ms
 ----
 
 If the query is rewritten with a `CALL` subquery the planner will use `StatefulShortestPath(Into)` which performs separate traversals for each individual source-target node pairs.