Merge branch 'dev' into 2025.x-next-by-table-semantics

Author: rsill-neo4j

modules/ROOT/pages/clauses/clause-composition.adoc

@@ -129,7 +129,9 @@ In a Cypher query, read and write clauses can take turns.
 The most important aspect of read-write queries is that the state of the graph also changes between clauses.
 
 [IMPORTANT]
+====
 A clause can never observe writes made by a later clause, and will observe all writes done by the previous clauses.
+====
 
 As of Cypher 25, read and write clauses can be combined in any order.
 That is, a write clause followed by a read clause no longer requires a separating xref:clauses/with.adoc[`WITH`] clause in order for the read clause to observe the changes made by a preceding write clause.

modules/ROOT/pages/clauses/filter.adoc

@@ -93,6 +93,38 @@ RETURN p.name AS person,
 3+|Rows: 2
 |===
 
+[[filter-on-dynamic-labels-and-types]]
+== Filter on dynamic labels and types
+
+To filter on a label or relationship type using a dynamically computed value, use `$(<expr>)` where <expr> is any Cypher expression:
+
+.Parameters
+[source, parameters]
+----
+{
+  "label": "Swedish"
+}
+----
+
+.Filter on a dynamically computed node label
+// tag::clauses_where_dynamic[]
+[source, cypher]
+----
+MATCH (n)
+FILTER n:$($label)
+RETURN labels(n) AS labels
+----
+// end::clauses_where_dynamic[]
+
+.Result
+[role="queryresult",options="header,footer",cols="1*<m"]
+|===
+| labels
+| ["Person", "Swedish"]
+1+d|Rows: 1
+|===
+
+
 [[filter-on-dynamic-properties]]
 == Filter on dynamic properties
 

modules/ROOT/pages/clauses/where.adoc

@@ -103,6 +103,38 @@ RETURN f.name AS oldFriend
 |===
 
 
+[[filter-on-dynamic-labels-and-types]]
+== Filter on dynamic labels and types
+
+To filter on a label or relationship type using a dynamically computed value, use `$(<expr>)` where <expr> is any Cypher expression:
+
+.Parameters
+[source, parameters]
+----
+{
+  "label": "Swedish"
+}
+----
+
+.Filter on a dynamically computed node label
+// tag::clauses_where_dynamic[]
+[source, cypher]
+----
+MATCH (n)
+WHERE n:$($label)
+RETURN labels(n) AS labels
+----
+// end::clauses_where_dynamic[]
+
+.Result
+[role="queryresult",options="header,footer",cols="1*<m"]
+|===
+| labels
+| ["Person", "Swedish"]
+1+d|Rows: 1
+|===
+
+
 [[filter-on-dynamic-properties]]
 == Filter on dynamic properties
 

modules/ROOT/pages/deprecations-additions-removals-compatibility.adoc

@@ -22,6 +22,31 @@ Cypher 25 was introduced in Neo4j 2025.06 and can only be used on Neo4j 2025.06+
 Features removed in Cypher 25 are still available on Neo4j 2025.06+ databases either by prepending a query with `CYPHER 5` or by having Cypher 5 as the default language for the database.
 For more information, see xref:queries/select-version.adoc[].
 
+[[cypher-deprecations-additions-removals-2025.07]]
+== Neo4j 2025.07
+
+=== Updated in Cypher 25
+
+[cols="2", options="header"]
+|===
+| Feature
+| Details
+
+a|
+label:functionality[]
+label:updated[]
+[source, cypher, role="noheader"]
+----
+MATCH (n)-[r]->()
+WHERE n:$(<expr1>)
+WITH n, r:$(<expr2>) AS hasType
+RETURN n:$(<expr3>)
+----
+
+| Added the ability to dynamically reference node labels and relationship types in places where xref:patterns/reference.adoc#label-expressions[label expressions] are allowed.
+|===
+
+
 [[cypher-deprecations-additions-removals-2025.06]]
 == Neo4j 2025.06
 

modules/ROOT/pages/introduction/index.adoc

@@ -1,6 +1,6 @@
 [[cypher-intro]]
 ifdef::backend-pdf[]
-= Neo4j {neo4j-version} Cypher Manual
+= Neo4j Cypher {page-version} Manual
 endif::[]
 ifndef::backend-pdf[]
 = Introduction

modules/ROOT/pages/patterns/match-modes.adoc

@@ -256,3 +256,9 @@ RETURN count(p) AS pathCount
 ----
 The quantified path pattern may yield an infinite number of rows under match mode 'REPEATABLE ELEMENTS'. Add an upper bound to the quantified path pattern.
 ----
+
+
+[[further-reading]]
+== Further reading
+
+* link:https://medium.com/neo4j/i-would-walk-500-miles-5d23c33d967f[Neo4j Developer Blog: I Would Walk 500 Miles]

modules/ROOT/pages/patterns/reference.adoc

@@ -314,6 +314,19 @@ The following matches relationships that have a type that is neither `A` nor `B`
 -[:!A&!B]->
 ----
 
+[[dynamic-label-and-type-expressions]]
+=== Dynamic label and type expressions
+
+Node labels and relationship types can be referenced dynamically in expressions, parameters, and variables within label expressions.
+
+.Syntax for creating nodes and relationships dynamically
+[source, syntax]
+----
+dynamicLabelExpression ::= ":$(" + valueExpression ")"
+----
+
+The `valueExpression` must evaluate to a `STRING NOT NULL | LIST<STRING NOT NULL> NOT NULL` value.
+
 [[property-key-value-expressions]]
 == Property key-value expressions
 

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

@@ -562,4 +562,4 @@ Using inline predicates or making quantified path patterns more specific where p
 == Further reading
 
 * 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]
-* 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?]
+* 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/execution-plans.adoc

@@ -141,7 +141,7 @@ The `id` column specifies a unique ID assigned to each operator.
 There are no guarantees about the order of the ids, although they will usually start with 0 at the root operator, and will increase until the leaf operator is reached at the beginning of the operator tree.
 
 The `Details` column in the middle of the execution plan describes what task is performed by each operator.
-For example, the details column of the xref::planning-and-tuning/operators/operators-detail.adoc#query-plan-repeat[Repeat(Trail)] operator in the middle of the execution plan (`id 5`), specifies that the operator traverses a quantified path pattern without an upward limit.
+For example, the details column of the xref::planning-and-tuning/operators/operators-detail.adoc#query-plan-repeat[Repeat] operator in the middle of the execution plan (`id 5`), specifies that the operator traverses a quantified path pattern without an upward limit.
 
 Finally, the `Estimated Rows` column details the number of rows that are expected to be produced by each operator.
 This estimate is an approximate number based on the available statistical information and the planner uses it to choose a suitable execution plan.footnote:[The statistical information maintained by Neo4j includes the following: the number of nodes having a certain label, the number of relationships by type, selectivity per index, and the number of relationships by type, ending with or starting from a node with a specific label.]

modules/ROOT/pages/planning-and-tuning/operators/index.adoc

@@ -423,8 +423,8 @@ Tests for the presence of a pattern predicate in queries containing multiple pat
 |
 
 | xref::planning-and-tuning/operators/operators-detail.adoc#query-plan-nullify-metadata[NullifyMetadata]
-| responsible for cleaning up the state produced by xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-repeat[`Repeat(Trail)`].
-It is only planned directly after `Repeat(Trail)`.
+| responsible for cleaning up the state produced by xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-repeat[`Repeat`].
+It is only planned directly after `Repeat`.
 |
 |
 | 
@@ -632,7 +632,7 @@ It also fetches the start and end nodes of those relationships.
 |
 |
 
-| xref::planning-and-tuning/operators/operators-detail.adoc#query-plan-repeat[Repeat(Trail)]
+| xref::planning-and-tuning/operators/operators-detail.adoc#query-plan-repeat[Repeat]
 | Solves quantified path patterns.
 |
 |