Skip to content

Commit adcee52

Browse files
Further reading (#1281)
1 parent c44f82e commit adcee52

File tree

4 files changed

+20
-0
lines changed

4 files changed

+20
-0
lines changed

modules/ROOT/pages/clauses/match.adoc

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -644,3 +644,7 @@ This is because the xref:planning-and-tuning/execution-plans.adoc[Cypher planner
644644

645645
As a result, `MATCH` queries using dynamic values cannot leverage xref:planning-and-tuning/operators/operators-detail.adoc#leaf-operators[index scans or seeks] and must instead use the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-all-nodes-scan[`AllNodesScan`] operator, which reads all nodes from the node store and is therefore more costly.
646646

647+
[[further-reading]]
648+
=== Further reading
649+
650+
link:https://medium.com/neo4j/cypher-dynamism-a-step-toward-simpler-and-more-secure-queries-70fab8a815b2[Neo4j Developer Blog: Cypher Dynamism: A Step Toward Simpler and More Secure Queries]

modules/ROOT/pages/patterns/variable-length-patterns.adoc

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -557,3 +557,9 @@ RETURN reduce(acc = 0, r in relationships(p) | round(acc + r.distance, 2))
557557
This query avoids having to find all possible paths and then imposing a `LIMIT 1` to find the shortest one by distance.
558558
It also shows that there is only one path to solving the query (a number that remains constant even if the data from the rest of the UK railway network was included).
559559
Using inline predicates or making quantified path patterns more specific where possible can thus greatly improve query performance.
560+
561+
[[further-reading]]
562+
== Further reading
563+
564+
* link:https://medium.com/neo4j/getting-from-denmark-hill-to-gatwick-airport-with-quantified-path-patterns-bed38da27ca1[Neo4j Developer Blog: Getting From Denmark Hill to Gatwick Airport With Quantified Path Patterns]
565+
* link:https://medium.com/neo4j/did-you-take-the-neo4j-5-cypher-bullet-train-6a857c92d669[Neo4j Developer Blog: Did You Take the Neo4j 5 Cypher Bullet Train?]

modules/ROOT/pages/planning-and-tuning/runtimes/concepts.adoc

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -400,3 +400,8 @@ The below table summarizes the most important distinctions between the three dif
400400
| *Supported query type* | Read and write | Read and write | Read only
401401

402402
|===
403+
404+
[[further-reading]]
405+
== Further reading
406+
407+
* link:https://medium.com/neo4j/speed-up-your-queries-with-neo4js-new-parallel-runtime-04d4487cd6b5[Neo4j Developer Blog: Speed Speed Up Your Queries With Neo4j’s New Parallel Runtime]

modules/ROOT/pages/subqueries/subqueries-in-transactions.adoc

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1101,3 +1101,8 @@ These are the restrictions on queries that use `CALL { ... } IN TRANSACTIONS`:
11011101
* A `CALL { ... } IN TRANSACTIONS` in a `UNION` is not supported.
11021102
* A `CALL { ... } IN TRANSACTIONS` after a write clause is not supported, unless that write clause is inside a `CALL { ... } IN TRANSACTIONS`.
11031103

1104+
1105+
[[further-reading]]
1106+
== Further reading
1107+
1108+
* link:https://medium.com/neo4j/introducing-concurrent-writes-to-cypher-subqueries-5102198931ab[Neo4j Developer Blog: Introducing Concurrent Writes to Cypher Subqueries]

0 commit comments

Comments
 (0)