Merge branch 'cypher-25' into imagesrefresh

Author: lidiazuin

modules/ROOT/pages/appendix/gql-conformance/additional-cypher.adoc

@@ -72,10 +72,10 @@ Either the pattern already exists, or it needs to be created.
 | xref:expressions/list-expressions.adoc#list-comprehension[List comprehension]
 | Syntactic construct for creating a `LIST` based on existing lists.
 
-| xref:values-and-types/maps.adoc#cypher-map-comprehension[Map projection]
+| xref:expressions/map-expressions.adoc#map-projection[Map projection]
 | Constructs `MAP` projections from nodes, relationships, and other `MAP` values.
 
-| xref:values-and-types/lists.adoc#cypher-pattern-comprehension[Pattern comprehension]
+| xref:expressions/list-expressions.adoc#pattern-comprehension[Pattern comprehension]
 | Syntactic construct for creating a `LIST` based on matchings of a pattern.
 |===
 
@@ -389,12 +389,12 @@ It is only supported in the xref:clauses/use.adoc[`USE`] clause.
 | xref:functions/spatial.adoc#functions-point[`point()`]
 | Returns a 2D or 3D point object, given two or respectively three coordinate values in the Cartesian coordinate system or WGS 84 geographic coordinate system.
 
-| xref:functions/spatial.adoc#functions-point-distance[`point.distance()`]
+| xref:functions/spatial.adoc#functions-distance[`point.distance()`]
 | Returns a `FLOAT` representing the distance between any two points in the same CRS.
 If the points are in the WGS 84 CRS, the function returns the geodesic distance (i.e., the shortest path along the curved surface of the Earth).
 If the points are in a Cartesian CRS, the function returns the Euclidean distance (i.e., the shortest straight-line distance in a flat, planar space).
 
-| xref:functions/spatial.adoc#functions-point-withinBBox[`point.withinBBox()`]
+| xref:functions/spatial.adoc#functions-withinBBox[`point.withinBBox()`]
 | Returns true if the provided point is within the bounding box defined by the two provided points.
 
 |===

modules/ROOT/pages/appendix/gql-conformance/index.adoc

@@ -1,7 +1,7 @@
 :description: Overview of Cypher's conformance to GQL.
 = GQL conformance
 
-*Last updated*: 4 March 2025 +
+*Last updated*: 2 June 2025 +
 *Neo4j version*: 2025.06
 
 GQL is the new link:https://www.iso.org/home.html[ISO] International Standard query language for graph databases.
@@ -47,4 +47,4 @@ For more information, see xref:syntax/parsing.adoc#_using_unicodes_in_cypher[Par
 * Cypher supports the following mandatory GQL property types: `BOOLEAN` (`BOOL`), `FLOAT` footnote:[The `FLOAT` type in Cypher always represents a 64-bit double-precision floating point number.], `INTEGER` (`SIGNED INTEGER`, or `INT`)footnote:[The `INTEGER` type in Cypher always represents a 64-bit `INTEGER`.], and `STRING` (`VARCHAR`).
 +
 Cypher also supports the following optional GQL property types: `DATE`, `DURATION`, `LIST<INNER_TYPE NOT NULL>` (`ARRAY<INNER_TYPE NOT NULL>`, `INNER_TYPE LIST`, or `INNER_TYPE ARRAY`)footnote:[The `INNER_TYPE` cannot be a `LIST` type.], `LOCAL DATETIME` (`TIMESTAMP WITHOUT TIME ZONE`), `LOCAL TIME` (`TIME WITHOUT TIME ZONE`), `POINT`, `ZONED DATETIME` (`TIME WITH TIME ZONE`), and `ZONED TIME` (`TIMESTAMP WITH TIME ZONE`).
-For more information, see xref:values-and-types/property-structural-constructed.adoc#_property_types[Values and types -> property types].
+For more information, see xref:values-and-types/property-structural-constructed.adoc#property-types[Values and types -> property types].

modules/ROOT/pages/appendix/gql-conformance/supported-mandatory.adoc

@@ -11,19 +11,24 @@ The below table is instead listed in order of their appearance in the link:https
 | Documentation
 | Comment
 
+| 4.9.2
+| GQL-status objects
+| link:https://neo4j.com/docs/status-codes/current/[Status Codes for Errors & Notifications]
+| Neo4j exposes successful execution results, errors, exceptions, and warnings as GQL-status objects.
+
 | 4.11
 | Graph pattern matching
 | xref:patterns/index.adoc[]
 |
 
 | 4.13
 | GQL object types
-| xref:values-and-types/property-structural-constructed.adoc#structural-types[Structural types],  xref:values-and-types/property-structural-constructed.adoc#type-synonyms[Types and their synonyms].
+| xref:values-and-types/property-structural-constructed.adoc#structural-types[Structural types],  xref:values-and-types/property-structural-constructed.adoc#types-synonyms[Types and their synonyms].
 | Includes: `NODE` (`ANY NODE`, `VERTEX`, `ANY VERTEX`) and `RELATIONSHIP` (`ANY RELATIONSHIP`, `EDGE`, `ANY EDGE`).
 
 | 4.16
 | Predefined value types
-| xref:values-and-types/property-structural-constructed.adoc#property-types[Property types], xref:values-and-types/property-structural-constructed.adoc#type-synonyms[Types and their synonyms].
+| xref:values-and-types/property-structural-constructed.adoc#property-types[Property types], xref:values-and-types/property-structural-constructed.adoc#types-synonyms[Types and their synonyms].
 | Includes: `BOOLEAN` (`BOOL`), `FLOAT`, `INTEGER` (`SIGNED INTEGER`, `INT`), and `STRING` (`VARCHAR`).
 
 Cypher supports the boolean type predicate for `true`, `false`, and `null` but does not support the GQL keyword `UNKNOWN`.
@@ -122,7 +127,7 @@ The only way to guarantee row order in Neo4j is to use xref:clauses/order-by.ado
 
 | 16.17
 | <sort specification list>
-| xref:clauses/order-by.adoc#order-nodes-in-descending-order[Order results in ascending or descending order]
+| xref:clauses/order-by.adoc#ascending-descending-order[Ascending and descending order]
 |
 
 | 16.19
@@ -137,7 +142,7 @@ The only way to guarantee row order in Neo4j is to use xref:clauses/order-by.ado
 
 | 19.4
 | <exists predicate>
-| xref:functions/predicate.adoc#function-exists[`exists()`]
+| xref:functions/predicate.adoc#functions-exists[`exists()`]
 |
 
 | 19.5
@@ -173,7 +178,7 @@ In Cypher, current user details can be seen using the link:{neo4j-docs-base-uri}
 
 | 20.9
 | <aggregate function>
-| xref:functions/aggregating.adoc#functions-avg[`avg()`], xref:functions/aggregating.adoc#functions-count[`count()`], xref:functions/aggregating.adoc#functions-max[`max`], xref:functions/aggregating.adoc#functions-mind[`min()`], xref:functions/aggregating.adoc#functions-sum[`sum()`]
+| xref:functions/aggregating.adoc#functions-avg[`avg()`], xref:functions/aggregating.adoc#functions-count[`count()`], xref:functions/aggregating.adoc#functions-max[`max`], xref:functions/aggregating.adoc#functions-min[`min()`], xref:functions/aggregating.adoc#functions-sum[`sum()`]
 | Cypher and GQL handle `null` values differently for the `sum()` function when queries return 0 rows. 
 For example, `RETURN sum(<expr>)` on an empty table returns `null` in GQL, but in Cypher it returns `0`.
 

modules/ROOT/pages/appendix/gql-conformance/unsupported-mandatory.adoc

@@ -14,10 +14,6 @@ The below table is instead listed in order of their appearance in the link:https
 | Description
 | Comment and similar Neo4j functionality
 
-| 4.9.2
-| GQL-status objects
-| Exposing successful execution results, errors, exceptions, and warnings as GQL-status objects.
-
 | 7.1-7.3
 | Session management
 | GQL defines the following session commands: `SESSION SET`, `SESSION RESET`, and `SESSION CLOSE`.

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

@@ -974,7 +974,7 @@ materialize the table of intermediate results before executing the next clause.
 This approach would consume a lot of memory for materializing the tables of intermediate results and would generally not perform well.
 
 Instead, Cypher will in general try to interleave the execution of clauses.
-This is called xref::planning-and-tuning/execution-plans.adoc#laze-eager-evaluation[lazy evaluation].
+This is called xref::planning-and-tuning/execution-plans.adoc#lazy-eager-evaluation[lazy evaluation].
 It only materializes intermediate results when needed.
 In many read-write queries it is unproblematic to execute clauses interleaved, but when it is not,
 Cypher must ensure that the table of intermediate results gets materialized at the right time(s).

modules/ROOT/pages/clauses/filter.adoc

@@ -202,7 +202,7 @@ Because `WHERE` is a subclause qualifying a described pattern, it can be used in
 ----
 WITH 35 AS minAge
 MATCH (a:Person WHERE a.name = 'Andy')-[:KNOWS]->(b:Person WHERE b.age > minAge)
-RETURN b.name AS name`
+RETURN b.name AS name
 ----
 .Result
 [role="queryresult",options="header,footer",cols="1*<m"]

modules/ROOT/pages/clauses/index.adoc

@@ -275,7 +275,7 @@ These comprise clauses to create, show, and drop indexes and constraints.
 |===
 | Clause | Description
 
-m| xref:indexes/search-performance-indexes/managing-indexes.adoc#indexes-syntax[CREATE \| SHOW  \| DROP INDEX]
+m| xref:indexes/syntax.adoc[CREATE \| SHOW  \| DROP INDEX]
 | Create, show or drop an index.
 
 m| xref::constraints/syntax.adoc[CREATE \| SHOW \| DROP CONSTRAINT]

modules/ROOT/pages/clauses/let.adoc

@@ -216,7 +216,7 @@ ORDER BY price
 | "Chocolate" | 5 | TRUE | 'Budget'
 | "Coffee" | 10 | TRUE | 'Budget'
 | "Headphones" | 250 | TRUE | 'Budget'
-| "Phone" | 600   | FALSE | 'High-end'
+| "Phone" | 500   | FALSE | 'High-end'
 | "Laptop" | 1000  | FALSE | 'High-end'
 
 4+d|Rows: 5

modules/ROOT/pages/clauses/match.adoc

@@ -147,7 +147,7 @@ For a list of all label expressions supported by Cypher, see xref:patterns/refer
 
 The `MATCH` clause allows you to specify relationship patterns of varying complexity to retrieve from a graph.
 Unlike a node pattern, a relationship pattern cannot be used in a `MATCH` clause without node patterns at both ends.
-For more information about relationship patterns, see xref:patterns/fixed-length-patterns#relationship patterns[Patterns -> Relationship patterns].
+For more information about relationship patterns, see xref:patterns/fixed-length-patterns#relationship-patterns[Patterns -> Relationship patterns].
 
 [NOTE]
 Relationships will only be matched once inside a single pattern.
@@ -643,3 +643,7 @@ This is because the xref:planning-and-tuning/execution-plans.adoc[Cypher planner
 
 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.
 
+[[further-reading]]
+=== Further reading
+
+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/clauses/merge.adoc

@@ -375,20 +375,21 @@ Cannot merge the following relationship because of null property value for 'sinc
 
 [NOTE]
 ====
-As of Neo4j 5.20, specifying a property of an entity (node or relationship) by referring to the property of another entity in the same `MERGE` clause is deprecated.
+Specifying a property of an entity (node or relationship) by referring to the property of another entity within the same `MERGE` clause is not allowed.
 
-For example, referring to `charlie.bornIn` in the property definition of `oliver.bornIn` is deprecated.
+For example, referring to `charlie.bornIn` in the property definition of `oliver.bornIn` is not allowed.
 
 .Query
-[source, cypher]
+[source, cypher, role=test-fail]
 ----
 MERGE (charlie:Person {name: 'Charlie Sheen', bornIn: 'New York'})-[:ACTED_IN]->(movie:Movie)<-[:DIRECTED]-(oliver:Person {name: 'Oliver Stone', bornIn: charlie.bornIn})
 RETURN movie
 ----
 
-[source, deprecation]
+.Error message
+[source, error]
 ----
-Merging an entity (charlie) and referencing that entity in a property definition in the same MERGE is deprecated.
+The Node variable 'charlie' is referencing a Node that is created in the same MERGE clause which is not allowed. Please only reference variables created in earlier clauses
 ----
 ====
 
@@ -422,7 +423,7 @@ Instead, a new `Movie` node is created.
 === Merge on an undirected relationship
 
 `MERGE` can also be used without specifying the direction of a relationship.
-Cypher will first try to xref:clauses/match.adoc#_match_on_an_undirected_relationship[match the relationship in both directions].
+Cypher will first try to match the relationship in both directions.
 If the relationship does not exist in either direction, it will create one left to right.
 
 .Query