Skip to content

Commit

Permalink
Apply suggestions from code review
Browse files Browse the repository at this point in the history
Co-authored-by: Jens Pryce-Åklundh <112686610+JPryce-Aklundh@users.noreply.github.com>
  • Loading branch information
pontusmelke and JPryce-Aklundh authored Jan 17, 2024
1 parent 519a7a9 commit 1bbcbca
Showing 1 changed file with 13 additions and 11 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -315,7 +315,7 @@ Total database accesses: 2, total allocated memory: 184
== Directed Relationship By Element Id Seek
// DirectedRelationshipByElementIdSeek

The `DirectedRelationshipByElementIdSeek` operator reads one or more relationships by element id from the relationship store, and produces both the relationship and the nodes on either side.
The `DirectedRelationshipByElementIdSeek` operator reads one or more relationships by element id from the relationship store (specified via the function xref::functions/scalar.adoc#functions-elementid[elementId()]) and produces both the relationship and the nodes on either side.


.DirectedRelationshipByElementIdSeek
Expand Down Expand Up @@ -401,7 +401,7 @@ Total database accesses: 8, total allocated memory: 312
== Undirected Relationship By Element Id Seek
// UndirectedRelationshipByElementIdSeek

The `UndirectedRelationshipByElementIdSeek` operator reads one or more relationships by element id from the relationship store.
The `UndirectedRelationshipByElementIdSeek` operator reads one or more relationships by element id from the relationship store (specified via the function xref::functions/scalar.adoc#functions-elementid[elementId()]).
As the direction is unspecified, two rows are produced for each relationship as a result of alternating the combination of the start and end node.


Expand Down Expand Up @@ -445,7 +445,7 @@ Total database accesses: 1, total allocated memory: 184
== Undirected Relationship By Id Seek
// UndirectedRelationshipByIdSeek

The `UndirectedRelationshipByIdSeek` operator reads one or more relationships by id from the relationship store.
The `UndirectedRelationshipByIdSeek` operator reads one or more relationships by id from the relationship store (specified via the function xref::functions/scalar.adoc#functions-elementid[elementId()]).
As the direction is unspecified, two rows are produced for each relationship as a result of alternating the combination of the start and end node.


Expand Down Expand Up @@ -1148,7 +1148,7 @@ Total database accesses: 1, total allocated memory: 184
== Node By Id Seek
// NodeByIdSeek

The `NodeByIdSeek` operator reads one or more nodes by ID from the node store, specified via the function xref::functions/scalar.adoc#functions-id[id()].
The `NodeByIdSeek` operator reads one or more nodes by id from the node store, specified via the function xref::functions/scalar.adoc#functions-id[id()].


.NodeByIdSeek
Expand Down Expand Up @@ -1193,7 +1193,7 @@ Total database accesses: 3, total allocated memory: 312
== Node By Element Id Seek
// NodeByElementIdSeek

The `NodeByElementIdSeek` operator reads one or more nodes by element ID from the node store, specified via the function xref::functions/scalar.adoc#functions-elementid[elementId()].
The `NodeByElementIdSeek` operator reads one or more nodes by element id from the node store, specified via the function xref::functions/scalar.adoc#functions-elementid[elementId()].


.NodeByElementIdSeek
Expand Down Expand Up @@ -1901,7 +1901,7 @@ Total database accesses: 166, total allocated memory: 976
== TransactionApply
// TransactionApply

`TransactionApply` works like normal `Apply` but will commit the current transaction after a specified number of rows.
`TransactionApply` works like the `Apply` operator but will commit the current transaction after a specified number of rows.

.TransactionApply
======
Expand Down Expand Up @@ -3058,7 +3058,9 @@ Total database accesses: 318, total allocated memory: 208
== Nullify Metadata
// NullifyMetadata
_This feature was introduced in Neo4j 5.9._
NullifyMetadata is responsible for cleaning up state associated with Repeat(Trail), it is only planned directly after Repeat(Trail).

`NullifyMetadata` is responsible for cleaning up the state associated with `Repeat(Trail)`.
It is only planned directly after `Repeat(Trail)`.

.NullifyMetadata
======
Expand Down Expand Up @@ -3820,7 +3822,7 @@ Total database accesses: 9, total allocated memory: 64
== TransactionForeach
// TransactionForeach

`TransactionForeach` works like normal `Foreach` but will commit the current transaction after a specified number of rows.
`TransactionForeach` works like the `Foreach` operator but will commit the current transaction after a specified number of rows.

.TransactionForeach
======
Expand Down Expand Up @@ -3872,7 +3874,7 @@ Batch size 128
== SubqueryForeach
// SubqueryForeach

`SubqueryForeach` like normal `Foreach` but used for executing sub-queries.
`SubqueryForeach` works like the `Foreach` operator but it is only used for executing subqueries.

.SubqueryForeach
======
Expand Down Expand Up @@ -6099,8 +6101,8 @@ Total database accesses: 0, total allocated memory: 64
== Argument Tracker
// ArgumentTracker

The `ArgumentTracker` operator is used to make sure we have row-by-row semantics.
This restricts the runtime not to batch operations in larger chunks.
The `ArgumentTracker` operator is used to ensure row-by-row semantics.
This restricts the xref:planning-and-tuning/runtimes/index.adoc[Cypher runtime] to not batch operations in larger chunks.

.ArgumentTracker
======
Expand Down

0 comments on commit 1bbcbca

Please sign in to comment.