update operators-detail page with xrefs

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

@@ -570,7 +570,7 @@ It also finds the start and end nodes of those relationships.
 | label:new[Introduced in 5.17]
 
 | xref::planning-and-tuning/operators/operators-detail.adoc#query-plan-partitioned-undirected-relationship-type-scan[PartitionedUndirectedRelationshipTypeScan]
-| Used by the parallel runtime to fetch all relationships with a specific type from relationship type index.
+| Used by the parallel runtime to fetch all relationships with a specific type from the relationship type index.
 It also fetches the start and end nodes of those relationships.
 | label:yes[]
 |

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

@@ -133,7 +133,7 @@ Total database accesses: 36, total allocated memory: 184
 _This feature was introduced in Neo4j 5.17._
 
 
-The `PartitionedAllNodesScan` is a variant of the normal `AllNodesScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedAllNodesScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-all-nodes-scan[`AllNodesScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the store to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 .PartitionedAllNodesScan
@@ -231,7 +231,7 @@ Total database accesses: 16, total allocated memory: 184
 _This feature was introduced in Neo4j 5.17._
 
 
-The `PartitionedDirectedRelationshipIndexScan` is a variant of the normal `DirectedRelationshipIndexScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedDirectedRelationshipIndexScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-directed-relationship-index-scan[`DirectedRelationshipIndexScan`] used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 .PartitionedDirectedRelationshipIndexScan
@@ -322,7 +322,7 @@ Total database accesses: 16, total allocated memory: 184
 _This feature was introduced in Neo4j 5.17._
 
 
-The `PartitionedUndirectedRelationshipIndexScan` is a variant of the normal `UndirectedRelationshipIndexScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedUndirectedRelationshipIndexScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-undirected-relationship-index-scan[`UndirectedRelationshipIndexScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 .PartitionedUndirectedRelationshipIndexScan
@@ -415,7 +415,7 @@ Total database accesses: 2, total allocated memory: 184
 _This feature was introduced in Neo4j 5.17._
 
 
-The `PartitionedDirectedRelationshipIndexSeek` is a variant of the normal `DirectedRelationshipIndexSeek` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedDirectedRelationshipIndexSeek` is a variant of the the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-directed-relationship-index-seek[`DirectedRelationshipIndexSeek`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 .PartitionedDirectedRelationshipIndexSeek
@@ -969,7 +969,7 @@ Total database accesses: 46, total allocated memory: 184
 _This feature was introduced in Neo4j 5.17._
 
 
-The `PartitionedDirectedRelationshipIndexSeekByRange` is a variant of the normal `DirectedRelationshipIndexSeekByRange` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedDirectedRelationshipIndexSeekByRange` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-directed-relationship-index-seek-by-range[`DirectedRelationshipIndexSeekByRange`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 .PartitionedDirectedRelationshipIndexSeekByRange
@@ -1066,7 +1066,7 @@ Total database accesses: 76, total allocated memory: 184
 _This feature was introduced in Neo4j 5.17._
 
 
-The `PartitionedUndirectedRelationshipIndexSeekByRange` is a variant of the normal `UndirectedRelationshipIndexSeekByRange` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedUndirectedRelationshipIndexSeekByRange` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-undirected-relationship-index-seek-by-range[`UndirectedRelationshipIndexSeekByRange`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the store to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 .PartitionedUndirectedRelationshipIndexSeekByRange
@@ -1156,8 +1156,7 @@ Total database accesses: 13, total allocated memory: 184
 
 _This feature was introduced in Neo4j 5.17._
 
-
-The `PartitionedUnionNodeByLabelsScan` is a variant of the normal `UnionNodeByLabelsScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedUnionNodeByLabelsScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-union-node-by-labels-scan[`UnionNodeByLabelsScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 ======
 
@@ -1244,7 +1243,7 @@ Total database accesses: 13, total allocated memory: 184
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedIntersectionNodeByLabelsScan` is a variant of the normal `IntersectionNodeByLabelsScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedIntersectionNodeByLabelsScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-intersection-node-by-labels-scan[`IntersectionNodeByLabelsScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 ======
 
@@ -1323,13 +1322,14 @@ Total database accesses: 28, total allocated memory: 184
 ======
 
 [[query-plan-partitioned-directed-all-relationships-scan]]
-== Partitioned Directed All Relationships Scan ==
+== Partitioned Directed All Relationships Scan
 // New in 5.17
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedDirectedAllRelationshipsScan` is a variant of the normal `DirectedAllRelationshipsScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedDirectedAllRelationshipsScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-directed-all-relationships-scan[`DirectedAllRelationshipsScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the store to be partitioned into different segments where each segment can be scanned independently in parallel.
+
 ======
 
 .Query
@@ -1401,12 +1401,12 @@ Total database accesses: 28, total allocated memory: 184
 ======
 
 [[query-plan-partitioned-undirected-all-relationships-scan]]
-== Partitioned Undirected All Relationships Scan ==
+== Partitioned Undirected All Relationships Scan
 // New in 5.17
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedUndirectedAllRelationshipsScan` is a variant of the normal `UndirectedAllRelationshipsScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedUndirectedAllRelationshipsScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-undirected-all-relationships-scan[`UndirectedAllRelationshipsScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the store to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 ======
@@ -1491,7 +1491,7 @@ Total database accesses: 13, total allocated memory: 184
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedDirectedRelationshipTypeScan` is a variant of the normal `DirectedRelationshipTypeScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedDirectedRelationshipTypeScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-directed-relationship-type-scan[`DirectedRelationshipTypeScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 .PartitionedDirectedRelationshipTypeScan
@@ -1578,7 +1578,7 @@ Total database accesses: 13, total allocated memory: 184
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedUndirectedRelationshipTypeScan` is a variant of the normal `UndirectedRelationshipTypeScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedUndirectedRelationshipTypeScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-undirected-relationship-type-scan[`UndirectedRelationshipTypeScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 ======
@@ -1621,10 +1621,10 @@ Total database accesses: 37
 == Directed Union Relationship Types Scan
 // DirectedUnionRelationshipTypesScan
 
-The `DirectedUnionRelationshipTypeScan` operator fetches all relationships and their start and end nodes with at least one of the provided types from the relationship type index.
+The `DirectedUnionRelationshipTypesScan` operator fetches all relationships and their start and end nodes with at least one of the provided types from the relationship type index.
 
 
-.DirectedUnionRelationshipTypeScan
+.DirectedUnionRelationshipTypesScan
 ======
 
 .Query
@@ -1661,12 +1661,12 @@ Total database accesses: 14, total allocated memory: 184
 
 [[query-plan-partitioned-directed-union-relationship-types-scan]]
 == PartitionedDirected Union Relationship Types Scan
-// PartitionedDirectedUnionRelationshipTypeScan
+// PartitionedDirectedUnionRelationshipTypesScan
 // New in 5.17
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedDirectedUnionRelationshipTypeScan` is a variant of the normal `DirectedUnionRelationshipTypeScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedDirectedUnionRelationshipTypeScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-directed-union-relationship-types-scan[`DirectedUnionRelationshipTypesScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 
@@ -1711,7 +1711,7 @@ Total database accesses: 25
 == Undirected Union Relationship Types Scan
 // UndirectedUnionRelationshipTypesScan
 
-The `UndirectedUnionRelationshipTypeScan` operator fetches all relationships and their start and end nodes with at least one of the provided types from the relationship type index.
+The `UndirectedUnionRelationshipTypesScan` operator fetches all relationships and their start and end nodes with at least one of the provided types from the relationship type index.
 
 
 .UndirectedUnionRelationshipTypeScan
@@ -1751,15 +1751,15 @@ Total database accesses: 14, total allocated memory: 184
 
 [[query-plan-partitioned-undirected-union-relationship-types-scan]]
 == Partitioned Undirected Union Relationship Types Scan
-// PartitionedUndirectedUnionRelationshipTypeScan
+// PartitionedUndirectedUnionRelationshipTypesScan
 // New in 5.17
 
- _This feature was introduced in Neo4j 5.17._
+_This feature was introduced in Neo4j 5.17._
 
- The `PartitionedUndirectedUnionRelationshipTypeScan` is a variant of the normal `UndirectedUnionRelationshipTypeScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
- It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
+The `PartitionedUndirectedUnionRelationshipTypeScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-undirected-union-relationship-types-scan[`UndirectedUnionRelationshipTypesScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
-.PartitionedUndirectedUnionRelationshipTypeScan
+.PartitionedUndirectedUnionRelationshipTypesScan
 ======
 
 .Query
@@ -1934,7 +1934,7 @@ Total database accesses: 15, total allocated memory: 184
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedNodeByLabelScan` is a variant of the normal `NodeByLabelScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedNodeByLabelScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-node-by-label-scan[`NodeByLabelScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 
@@ -2033,7 +2033,7 @@ Total database accesses: 2, total allocated memory: 184
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedNodeIndexSeek` is a variant of the normal `NodeIndexSeek` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedNodeIndexSeek` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-node-index-seek[`NodeIndexSeek`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 
@@ -2295,7 +2295,7 @@ Total database accesses: 2, total allocated memory: 184
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedNodeIndexSeekByRange` is a variant of the normal `NodeIndexSeekByRange` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedNodeIndexSeekByRange` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-node-index-seek-by-range[`NodeIndexSeekByRange`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 
@@ -2530,7 +2530,7 @@ Total database accesses: 11, total allocated memory: 184
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedNodeIndexScan` is a variant of the normal `NodeIndexScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedNodeIndexScan` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-node-index-scan[`NodeIndexScan`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.
 
 
@@ -5630,7 +5630,7 @@ Total database accesses: 0, total allocated memory: 184
 
 _This feature was introduced in Neo4j 5.17._
 
-The `PartitionedDirectedRelationshipTypeScan` is a variant of the normal `DirectedRelationshipTypeScan` used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
+The `PartitionedUnwind` is a variant of the xref:planning-and-tuning/operators/operators-detail.adoc#query-plan-unwind[`Unwind`] operator used by the xref:planning-and-tuning/runtimes/concepts.adoc#runtimes-parallel-runtime[parallel runtime].
 It allows the index to be partitioned into different segments where each segment can be scanned independently in parallel.