Operators
All Nodes Scan
The AllNodesScan operator reads all nodes from the node store. The variable that will contain the nodes is seen in the arguments.
Any query using this operator is likely to encounter performance problems on a non-trivial database.
Query
MATCH (n)
RETURN nQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +ProduceResults | 35 | 35 | 0 | 2 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +AllNodesScan | 35 | 35 | 36 | 3 | 0 | 1.0000 | n |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
Total database accesses: 36Directed Relationship By Id Seek
The DirectedRelationshipByIdSeek operator reads one or more relationships by id from the relationship store, and produces both the relationship and the nodes on either side.
Query
MATCH (n1)-[r]->()
WHERE id(r)= 0
RETURN r, n1Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------------------------------------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------------------------------------------------------------------------+
| +ProduceResults | 1 | 1 | 0 | 3 | 0 | 1.0000 | anon[17], n1, r | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------------------------------------------------------------------------+
| +DirectedRelationshipByIdSeek | 1 | 1 | 1 | 4 | 0 | 1.0000 | anon[17], n1, r | EntityByIdRhs(ManySeekableArgs(ListLiteral(List(Parameter( AUTOINT0,Integer))))) |
+-------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------------------------------------------------------------------------+
Total database accesses: 1Node By Id Seek
The NodeByIdSeek operator reads one or more nodes by id from the node store.
Query
MATCH (n)
WHERE id(n)= 0
RETURN nQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +ProduceResults | 1 | 1 | 0 | 2 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +NodeByIdSeek | 1 | 1 | 1 | 3 | 0 | 1.0000 | n |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
Total database accesses: 1Node By Label Scan
The NodeByLabelScan operator fetches all nodes with a specific label from the node label index.
Query
MATCH (person:Person)
RETURN personQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +ProduceResults | 14 | 14 | 0 | 2 | 0 | 1.0000 | person | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +NodeByLabelScan | 14 | 14 | 15 | 3 | 0 | 1.0000 | person | :Person |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
Total database accesses: 15Node Index Seek
The NodeIndexSeek operator finds nodes using an index seek.
The node variable and the index used is shown in the arguments of the operator.
If the index is a unique index, the operator is instead called NodeUniqueIndexSeek.
Query
MATCH (location:Location { name: 'Malmo' })
RETURN locationQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+-----------+-----------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+-----------+-----------------+
| +ProduceResults | 1 | 1 | 0 | 2 | 1 | 0.6667 | location.name ASC | location | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+-----------+-----------------+
| +NodeIndexSeek | 1 | 1 | 3 | 2 | 1 | 0.6667 | location.name ASC | location | :Location(name) |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+-----------+-----------------+
Total database accesses: 3Node Unique Index Seek
The NodeUniqueIndexSeek operator finds nodes using an index seek within a unique index. The node variable and the index used is shown in the arguments of the operator.
If the index is not unique, the operator is instead called NodeIndexSeek.
If the index seek is used to solve a MERGE clause, it will also be marked with (Locking).
This makes it clear that any nodes returned from the index will be locked in order to prevent concurrent conflicting updates.
Query
MATCH (t:Team { name: 'Malmo' })
RETURN tQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 1 | 0.0000 | t.name ASC | t | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| +NodeUniqueIndexSeek | 1 | 0 | 2 | 0 | 1 | 0.0000 | t.name ASC | t | :Team(name) |
+----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
Total database accesses: 2Node Index Seek By Range
The NodeIndexSeekByRange operator finds nodes using an index seek where the value of the property matches a given prefix string.
NodeIndexSeekByRange can be used for STARTS WITH and comparison operators such as <, >, <= and >=.
If the index is a unique index, the operator is instead called NodeUniqueIndexSeekByRange.
Query
MATCH (l:Location)
WHERE l.name STARTS WITH 'Lon'
RETURN lQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+----------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+----------------------------------------------+
| +ProduceResults | 2 | 1 | 0 | 3 | 0 | 1.0000 | l.name ASC | l | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+----------------------------------------------+
| +NodeIndexSeekByRange | 2 | 1 | 3 | 3 | 0 | 1.0000 | l.name ASC | l | :Location(name STARTS WITH $` AUTOSTRING0`) |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+----------------------------------------------+
Total database accesses: 3Node Unique Index Seek By Range
The NodeUniqueIndexSeekByRange operator finds nodes using an index seek within a unique index, where the value of the property matches a given prefix string.
NodeUniqueIndexSeekByRange is used by STARTS WITH and comparison operators such as <, >, <= and >=.
If the index is not unique, the operator is instead called NodeIndexSeekByRange.
Query
MATCH (t:Team)
WHERE t.name STARTS WITH 'Ma'
RETURN tQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+-----------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+------------------------------------------+
| +ProduceResults | 2 | 0 | 0 | 1 | 0 | 1.0000 | t.name ASC | t | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+------------------------------------------+
| +NodeUniqueIndexSeekByRange | 2 | 0 | 2 | 1 | 0 | 1.0000 | t.name ASC | t | :Team(name STARTS WITH $` AUTOSTRING0`) |
+-----------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+------------------------------------------+
Total database accesses: 2Node Index Contains Scan
The NodeIndexContainsScan operator examines all values stored in an index, searching for entries
containing a specific string; for example, in queries including CONTAINS.
Although this is slower than an index seek (since all entries need to be
examined), it is still faster than the indirection resulting from a label scan using NodeByLabelScan, and a property store
filter.
Query
MATCH (l:Location)
WHERE l.name CONTAINS 'al'
RETURN lQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-----------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-----------------------------------+
| +ProduceResults | 0 | 2 | 0 | 2 | 0 | 1.0000 | l.name ASC | l | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-----------------------------------+
| +NodeIndexContainsScan | 0 | 2 | 4 | 2 | 1 | 0.6667 | l.name ASC | l | :Location(name); $` AUTOSTRING0` |
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-----------------------------------+
Total database accesses: 4Node Index Ends With Scan
The NodeIndexEndsWithScan operator examines all values stored in an index, searching for entries
ending in a specific string; for example, in queries containing ENDS WITH.
Although this is slower than an index seek (since all entries need to be
examined), it is still faster than the indirection resulting from a label scan using NodeByLabelScan, and a property store
filter.
Query
MATCH (l:Location)
WHERE l.name ENDS WITH 'al'
RETURN lQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-----------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-----------------------------------+
| +ProduceResults | 0 | 0 | 0 | 0 | 0 | 0.0000 | l.name ASC | l | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-----------------------------------+
| +NodeIndexEndsWithScan | 0 | 0 | 2 | 0 | 1 | 0.0000 | l.name ASC | l | :Location(name); $` AUTOSTRING0` |
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-----------------------------------+
Total database accesses: 2Node Index Scan
The NodeIndexScan operator examines all values stored in an index, returning all nodes with a particular label having a specified property.
Query
MATCH (l:Location)
WHERE exists(l.name)
RETURN lQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-----------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-----------------+
| +ProduceResults | 10 | 10 | 0 | 2 | 0 | 1.0000 | l | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+-----------------+
| +NodeIndexScan | 10 | 10 | 12 | 2 | 1 | 0.6667 | l | :Location(name) |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-----------------+
Total database accesses: 12Undirected Relationship By Id Seek
The UndirectedRelationshipByIdSeek operator reads one or more relationships by id from the relationship store.
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.
Query
MATCH (n1)-[r]-()
WHERE id(r)= 1
RETURN r, n1Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+---------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+---------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------------+
| +ProduceResults | 1 | 2 | 0 | 3 | 0 | 1.0000 | anon[16], n1, r |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------------+
| +UndirectedRelationshipByIdSeek | 1 | 2 | 1 | 4 | 0 | 1.0000 | anon[16], n1, r |
+---------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------------+
Total database accesses: 1Apply
All the different Apply operators (listed below) share the same basic functionality: they perform a nested loop by taking a single row from the left-hand side, and using the Argument operator on the right-hand side, execute the operator tree on the right-hand side.
The versions of the Apply operators differ in how the results are managed.
The Apply operator (i.e. the standard version) takes the row produced by the right-hand side — which at this point contains data from both the left-hand and right-hand sides — and yields it..
Query
MATCH (p:Person { name:'me' })
MATCH (q:Person { name: p.secondName })
RETURN p, qQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 1 | 0.0000 | p.name ASC | p, q | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +Apply | 1 | 0 | 0 | 0 | 1 | 0.0000 | p.name ASC | p, q | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| | +NodeIndexSeek | 1 | 0 | 3 | 0 | 0 | 0.0000 | | q -- p | :Person(name) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +NodeIndexSeek | 1 | 1 | 3 | 0 | 1 | 0.0000 | p.name ASC | p | :Person(name) |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
Total database accesses: 6Semi Apply
The SemiApply operator tests for the presence of a pattern predicate, and is a variation of the Apply operator.
If the right-hand side operator yields at least one row, the row from the left-hand side operator is yielded by the SemiApply operator.
This makes SemiApply a filtering operator, used mostly for pattern predicates in queries.
Query
MATCH (p:Person)
WHERE (p)-[:FRIENDS_WITH]->(:Person)
RETURN p.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------------+----------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------------+----------------------------------------+
| +ProduceResults | 11 | 2 | 0 | 16 | 0 | 1.0000 | p, p.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------------+----------------------------------------+
| +Projection | 11 | 2 | 2 | 16 | 0 | 1.0000 | p.name -- p | {p.name : p.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------------+----------------------------------------+
| +SemiApply | 11 | 2 | 0 | 16 | 0 | 1.0000 | p | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------------------+----------------------------------------+
| | +Filter | 2 | 0 | 2 | 1 | 0 | 1.0000 | NODE45, REL27, p | ` NODE45`:Person |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------------------+----------------------------------------+
| | +Expand(All) | 2 | 2 | 16 | 1 | 0 | 1.0000 | NODE45, REL27 -- p | (p)-[ REL27:FRIENDS_WITH]->( NODE45) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------------------+----------------------------------------+
| | +Argument | 14 | 14 | 0 | 1 | 0 | 1.0000 | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------------+----------------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 17 | 0 | 1.0000 | p | :Person |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------------+----------------------------------------+
Total database accesses: 35Anti Semi Apply
The AntiSemiApply operator tests for the absence of a pattern, and is a variation of the Apply operator.
If the right-hand side operator yields no rows, the row from the left-hand side operator is yielded by the AntiSemiApply operator.
This makes AntiSemiApply a filtering operator, used for pattern predicates in queries.
Query
MATCH (me:Person { name: "me" }),(other:Person)
WHERE NOT (me)-[:FRIENDS_WITH]->(other)
RETURN other.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------+-------------------------+--------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------+-------------------------+--------------------------------------+
| +ProduceResults | 4 | 13 | 0 | 17 | 1 | 0.9444 | me.name ASC | me, other, other.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------+-------------------------+--------------------------------------+
| +Projection | 4 | 13 | 13 | 17 | 1 | 0.9444 | me.name ASC | other.name -- me, other | {other.name : other.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------+-------------------------+--------------------------------------+
| +AntiSemiApply | 4 | 13 | 0 | 17 | 1 | 0.9444 | me.name ASC | me, other | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------+-------------------------+--------------------------------------+
| | +Expand(Into) | 0 | 0 | 50 | 1 | 0 | 1.0000 | | REL62 -- me, other | (me)-[ REL62:FRIENDS_WITH]->(other) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------+-------------------------+--------------------------------------+
| | +Argument | 14 | 14 | 0 | 1 | 0 | 1.0000 | | me, other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------+-------------------------+--------------------------------------+
| +CartesianProduct | 14 | 14 | 0 | 17 | 1 | 0.9444 | me.name ASC | me -- other | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------+-------------------------+--------------------------------------+
| | +NodeByLabelScan | 14 | 14 | 15 | 17 | 0 | 1.0000 | | other | :Person |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------+-------------------------+--------------------------------------+
| +NodeIndexSeek | 1 | 1 | 3 | 17 | 1 | 0.9444 | me.name ASC | me | :Person(name) |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------+-------------------------+--------------------------------------+
Total database accesses: 81Let Semi Apply
The LetSemiApply operator tests for the presence of a pattern predicate, and is a variation of the Apply operator.
When a query contains multiple pattern predicates separated with OR, LetSemiApply will be used to evaluate the first of these.
It will record the result of evaluating the predicate but will leave any filtering to another operator.
In the example, LetSemiApply will be used to check for the presence of the FRIENDS_WITH
relationship from each person.
Query
MATCH (other:Person)
WHERE (other)-[:FRIENDS_WITH]->(:Person) OR (other)-[:WORKS_IN]->(:Location)
RETURN other.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +ProduceResults | 13 | 14 | 0 | 28 | 0 | 1.0000 | anon[27], other, other.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +Projection | 13 | 14 | 14 | 28 | 0 | 1.0000 | other.name -- anon[27], other | {other.name : other.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +SelectOrSemiApply | 14 | 14 | 0 | 28 | 0 | 1.0000 | anon[27] -- other | `anon[27]` |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Filter | 15 | 0 | 12 | 28 | 0 | 1.0000 | NODE87, REL73, other | ` NODE87`:Location |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Expand(All) | 15 | 12 | 24 | 28 | 0 | 1.0000 | NODE87, REL73 -- other | (other)-[ REL73:WORKS_IN]->( NODE87) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Argument | 14 | 12 | 0 | 28 | 0 | 1.0000 | other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +LetSemiApply | 14 | 14 | 0 | 28 | 0 | 1.0000 | anon[27] -- other | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Filter | 2 | 0 | 2 | 1 | 0 | 1.0000 | NODE53, REL35, other | ` NODE53`:Person |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Expand(All) | 2 | 2 | 16 | 1 | 0 | 1.0000 | NODE53, REL35 -- other | (other)-[ REL35:FRIENDS_WITH]->( NODE53) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Argument | 14 | 14 | 0 | 1 | 0 | 1.0000 | other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 29 | 0 | 1.0000 | other | :Person |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
Total database accesses: 83Let Anti Semi Apply
The LetAntiSemiApply operator tests for the absence of a pattern, and is a variation of the Apply operator.
When a query contains multiple negated pattern predicates — i.e. predicates separated with OR, where at
least one predicate contains NOT — LetAntiSemiApply will be used to evaluate the first of these.
It will record the result of evaluating the predicate but will leave any filtering to another operator.
In the example, LetAntiSemiApply will be used to check for the absence of
the FRIENDS_WITH relationship from each person.
Query
MATCH (other:Person)
WHERE NOT ((other)-[:FRIENDS_WITH]->(:Person)) OR (other)-[:WORKS_IN]->(:Location)
RETURN other.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +ProduceResults | 11 | 14 | 0 | 18 | 0 | 1.0000 | anon[32], other, other.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +Projection | 11 | 14 | 14 | 18 | 0 | 1.0000 | other.name -- anon[32], other | {other.name : other.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +SelectOrSemiApply | 14 | 14 | 0 | 18 | 0 | 1.0000 | anon[32] -- other | `anon[32]` |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Filter | 15 | 0 | 2 | 6 | 0 | 1.0000 | NODE93, REL79, other | ` NODE93`:Location |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Expand(All) | 15 | 2 | 4 | 6 | 0 | 1.0000 | NODE93, REL79 -- other | (other)-[ REL79:WORKS_IN]->( NODE93) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Argument | 14 | 2 | 0 | 6 | 0 | 1.0000 | other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +LetAntiSemiApply | 14 | 14 | 0 | 18 | 0 | 1.0000 | anon[32] -- other | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Filter | 2 | 0 | 2 | 1 | 0 | 1.0000 | NODE58, REL40, other | ` NODE58`:Person |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Expand(All) | 2 | 2 | 16 | 1 | 0 | 1.0000 | NODE58, REL40 -- other | (other)-[ REL40:FRIENDS_WITH]->( NODE58) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Argument | 14 | 14 | 0 | 1 | 0 | 1.0000 | other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 19 | 0 | 1.0000 | other | :Person |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
Total database accesses: 53Select Or Semi Apply
The SelectOrSemiApply operator tests for the presence of a pattern predicate and evaluates a predicate,
and is a variation of the Apply operator.
This operator allows for the mixing of normal predicates and pattern predicates
that check for the presence of a pattern.
First, the normal expression predicate is evaluated, and, only if it returns false, is the costly pattern predicate evaluated.
Query
MATCH (other:Person)
WHERE other.age > 25 OR (other)-[:FRIENDS_WITH]->(:Person)
RETURN other.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| +ProduceResults | 11 | 2 | 0 | 16 | 0 | 1.0000 | other, other.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| +Projection | 11 | 2 | 2 | 16 | 0 | 1.0000 | other.name -- other | {other.name : other.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| +SelectOrSemiApply | 14 | 2 | 14 | 16 | 0 | 1.0000 | other | other.age > $` AUTOINT0` |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| | +Filter | 2 | 0 | 2 | 1 | 0 | 1.0000 | NODE71, REL53, other | ` NODE71`:Person |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| | +Expand(All) | 2 | 2 | 16 | 1 | 0 | 1.0000 | NODE71, REL53 -- other | (other)-[ REL53:FRIENDS_WITH]->( NODE71) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| | +Argument | 14 | 14 | 0 | 1 | 0 | 1.0000 | other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 17 | 0 | 1.0000 | other | :Person |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
Total database accesses: 49Select Or Anti Semi Apply
The SelectOrAntiSemiApply operator is used to evaluate OR between a predicate and a negative pattern predicate
(i.e. a pattern predicate preceded with NOT), and is a variation of the Apply operator.
If the predicate returns true, the pattern predicate is not tested.
If the predicate returns false or null, SelectOrAntiSemiApply will instead test the pattern predicate.
Query
MATCH (other:Person)
WHERE other.age > 25 OR NOT (other)-[:FRIENDS_WITH]->(:Person)
RETURN other.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| +ProduceResults | 4 | 12 | 0 | 16 | 0 | 1.0000 | other, other.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| +Projection | 4 | 12 | 12 | 16 | 0 | 1.0000 | other.name -- other | {other.name : other.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| +SelectOrAntiSemiApply | 14 | 12 | 14 | 16 | 0 | 1.0000 | other | other.age > $` AUTOINT0` |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| | +Filter | 2 | 0 | 2 | 1 | 0 | 1.0000 | NODE75, REL57, other | ` NODE75`:Person |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| | +Expand(All) | 2 | 2 | 16 | 1 | 0 | 1.0000 | NODE75, REL57 -- other | (other)-[ REL57:FRIENDS_WITH]->( NODE75) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| | +Argument | 14 | 14 | 0 | 1 | 0 | 1.0000 | other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 17 | 0 | 1.0000 | other | :Person |
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+--------------------------------------------+
Total database accesses: 59Let Select Or Semi Apply
The LetSelectOrSemiApply operator is planned for pattern predicates that are combined with other predicates using OR.
This is a variation of the Apply operator.
Query
MATCH (other:Person)
WHERE (other)-[:FRIENDS_WITH]->(:Person) OR (other)-[:WORKS_IN]->(:Location) OR other.age = 5
RETURN other.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +ProduceResults | 13 | 14 | 0 | 28 | 0 | 1.0000 | anon[27], other, other.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +Projection | 13 | 14 | 14 | 28 | 0 | 1.0000 | other.name -- anon[27], other | {other.name : other.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +SelectOrSemiApply | 14 | 14 | 0 | 28 | 0 | 1.0000 | anon[27] -- other | `anon[27]` |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Filter | 15 | 0 | 12 | 28 | 0 | 1.0000 | NODE87, REL73, other | ` NODE87`:Location |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Expand(All) | 15 | 12 | 24 | 28 | 0 | 1.0000 | NODE87, REL73 -- other | (other)-[ REL73:WORKS_IN]->( NODE87) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Argument | 14 | 12 | 0 | 28 | 0 | 1.0000 | other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +LetSelectOrSemiApply | 14 | 14 | 14 | 28 | 0 | 1.0000 | anon[27] -- other | other.age = $` AUTOINT0` |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Filter | 2 | 0 | 2 | 1 | 0 | 1.0000 | NODE53, REL35, other | ` NODE53`:Person |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Expand(All) | 2 | 2 | 16 | 1 | 0 | 1.0000 | NODE53, REL35 -- other | (other)-[ REL35:FRIENDS_WITH]->( NODE53) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Argument | 14 | 14 | 0 | 1 | 0 | 1.0000 | other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 29 | 0 | 1.0000 | other | :Person |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
Total database accesses: 97Let Select Or Anti Semi Apply
The LetSelectOrAntiSemiApply operator is planned for negated pattern predicates — i.e. pattern predicates
preceded with NOT — that are combined with other predicates using OR.
This operator is a variation of the Apply operator.
Query
MATCH (other:Person)
WHERE NOT (other)-[:FRIENDS_WITH]->(:Person) OR (other)-[:WORKS_IN]->(:Location) OR other.age = 5
RETURN other.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+---------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+---------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +ProduceResults | 11 | 14 | 0 | 18 | 0 | 1.0000 | anon[31], other, other.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +Projection | 11 | 14 | 14 | 18 | 0 | 1.0000 | other.name -- anon[31], other | {other.name : other.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +SelectOrSemiApply | 14 | 14 | 0 | 18 | 0 | 1.0000 | anon[31] -- other | `anon[31]` |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Filter | 15 | 0 | 2 | 6 | 0 | 1.0000 | NODE91, REL77, other | ` NODE91`:Location |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Expand(All) | 15 | 2 | 4 | 6 | 0 | 1.0000 | NODE91, REL77 -- other | (other)-[ REL77:WORKS_IN]->( NODE91) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Argument | 14 | 2 | 0 | 6 | 0 | 1.0000 | other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +LetSelectOrAntiSemiApply | 14 | 14 | 14 | 18 | 0 | 1.0000 | anon[31] -- other | other.age = $` AUTOINT0` |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Filter | 2 | 0 | 2 | 1 | 0 | 1.0000 | NODE57, REL39, other | ` NODE57`:Person |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Expand(All) | 2 | 2 | 16 | 1 | 0 | 1.0000 | NODE57, REL39 -- other | (other)-[ REL39:FRIENDS_WITH]->( NODE57) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| | +Argument | 14 | 14 | 0 | 1 | 0 | 1.0000 | other | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 19 | 0 | 1.0000 | other | :Person |
+---------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------+--------------------------------------------+
Total database accesses: 67Conditional Apply
The ConditionalApply operator checks whether a variable is not null, and if so, the right child operator will be executed.
This operator is a variation of the Apply operator.
Query
MERGE (p:Person { name: 'Andy' })
ON MATCH SET p.exists = TRUEQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +EmptyResult | 1 | 0 | 0 | 2 | | | | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +AntiConditionalApply | 1 | 1 | 0 | 2 | | | | p | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| | +MergeCreateNode | 1 | 0 | 0 | 0 | 0 | 0.0000 | | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +ConditionalApply | 1 | 1 | 0 | 2 | | | | p | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| | +SetProperty | 1 | 1 | 3 | 2 | | | | p | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| | +Argument | 1 | 1 | 0 | 2 | | | | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +Optional | 1 | 1 | 0 | 2 | 0 | 1.0000 | p.name ASC | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +ActiveRead | 1 | 1 | 0 | 2 | 0 | 1.0000 | p.name ASC | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +NodeIndexSeek | 1 | 1 | 3 | 2 | 0 | 1.0000 | p.name ASC | p | :Person(name) |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
Total database accesses: 6Anti Conditional Apply
The AntiConditionalApply operator checks whether a variable is null, and if so, the right child operator will be executed.
This operator is a variation of the Apply operator.
Query
MERGE (p:Person { name: 'Andy' })
ON CREATE SET p.exists = TRUEQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +EmptyResult | 1 | 0 | 0 | 0 | 0 | 0.0000 | | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +AntiConditionalApply | 1 | 1 | 0 | 0 | 0 | 0.0000 | | p | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| | +SetProperty | 1 | 0 | 0 | 0 | 0 | 0.0000 | | p | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| | +MergeCreateNode | 1 | 0 | 0 | 0 | 0 | 0.0000 | | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +Optional | 1 | 1 | 0 | 0 | 1 | 0.0000 | p.name ASC | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +ActiveRead | 1 | 1 | 0 | 0 | 1 | 0.0000 | p.name ASC | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +NodeIndexSeek | 1 | 1 | 3 | 0 | 1 | 0.0000 | p.name ASC | p | :Person(name) |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
Total database accesses: 3Roll Up Apply
The RollUpApply operator is used to execute an expression which takes as input a pattern, and returns a list with content from the matched pattern;
for example, when using a pattern expression or pattern comprehension in a query.
This operator is a variation of the Apply operator.
Query
MATCH (p:Person)
RETURN p.name,[(p)-[:WORKS_IN]->(location)| location.name] AS citiesQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+----------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+----------------------------------------+
| +ProduceResults | 14 | 14 | 0 | 16 | 0 | 1.0000 | anon[33], cities, p, p.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+----------------------------------------+
| +Projection | 14 | 14 | 14 | 16 | 0 | 1.0000 | cities, p.name -- anon[33], p | {p.name : p.name, cities : `anon[33]`} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+----------------------------------------+
| +RollUpApply | 14 | 14 | 0 | 16 | 0 | 1.0000 | anon[33] -- p | anon[33] |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+----------------------------------------+
| | +Projection | 0 | 15 | 15 | 1 | 0 | 1.0000 | anon[32] -- REL38, location, p | { : location.name} |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+----------------------------------------+
| | +Expand(All) | 0 | 15 | 29 | 1 | 0 | 1.0000 | REL38, location -- p | (p)-[ REL38:WORKS_IN]->(location) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+----------------------------------------+
| | +Argument | 1 | 14 | 0 | 1 | 0 | 1.0000 | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+----------------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 17 | 0 | 1.0000 | p | :Person |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+----------------------------------------+
Total database accesses: 73Argument
The Argument operator indicates the variable to be used as an argument to the right-hand side of an Apply operator.
Query
MATCH (s:Person { name: 'me' })
MERGE (s)-[:FRIENDS_WITH]->(s)Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | | anon[40], s | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +EmptyResult | 1 | 0 | 0 | 5 | 1 | 0.8333 | | anon[40], s | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +Apply | 1 | 1 | 0 | 5 | 1 | 0.8333 | s.name ASC | anon[40], s | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +AntiConditionalApply | 1 | 1 | 0 | 3 | 0 | 1.0000 | | anon[40], s | |
| | |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +MergeCreateRelationship | 1 | 1 | 1 | 2 | 0 | 1.0000 | | anon[40] -- s | |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Argument | 1 | 1 | 0 | 2 | 0 | 1.0000 | | s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +AntiConditionalApply | 1 | 1 | 0 | 3 | 0 | 1.0000 | | anon[40], s | |
| | |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Optional | 1 | 1 | 0 | 3 | 0 | 1.0000 | | anon[40], s | |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +ActiveRead | 0 | 0 | 0 | 1 | 0 | 1.0000 | | anon[40], s | |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Expand(Into) | 0 | 0 | 4 | 1 | 0 | 1.0000 | | anon[40] -- s | (s)-[:FRIENDS_WITH]->(s) |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +LockNodes | 1 | 1 | 0 | 1 | 0 | 1.0000 | | s | s |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Argument | 1 | 1 | 0 | 1 | 0 | 1.0000 | | s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +Optional | 1 | 1 | 0 | 5 | 0 | 1.0000 | | anon[40], s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +ActiveRead | 0 | 0 | 0 | 2 | 0 | 1.0000 | | anon[40], s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +Expand(Into) | 0 | 0 | 4 | 2 | 0 | 1.0000 | | anon[40] -- s | (s)-[:FRIENDS_WITH]->(s) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +Argument | 1 | 1 | 0 | 2 | 0 | 1.0000 | | s | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +NodeIndexSeek | 1 | 1 | 3 | 5 | 1 | 0.8333 | s.name ASC | s | :Person(name) |
+------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
Total database accesses: 12Expand All
Given a start node, and depending on the pattern relationship, the Expand(All) operator will traverse incoming or outgoing relationships.
Query
MATCH (p:Person { name: 'me' })-[:FRIENDS_WITH]->(fof)
RETURN fofQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+--------------------+----------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+--------------------+----------------------------+
| +ProduceResults | 0 | 1 | 0 | 4 | 1 | 0.8000 | p.name ASC | anon[30], fof, p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+--------------------+----------------------------+
| +Expand(All) | 0 | 1 | 2 | 4 | 1 | 0.8000 | p.name ASC | anon[30], fof -- p | (p)-[:FRIENDS_WITH]->(fof) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+--------------------+----------------------------+
| +NodeIndexSeek | 1 | 1 | 3 | 4 | 1 | 0.8000 | p.name ASC | p | :Person(name) |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+--------------------+----------------------------+
Total database accesses: 5Expand Into
When both the start and end node have already been found, the Expand(Into) operator is used to find all relationships connecting the two nodes.
As both the start and end node of the relationship are already in scope, the node with the smallest degree will be used.
This can make a noticeable difference when dense nodes appear as end points.
Query
MATCH (p:Person { name: 'me' })-[:FRIENDS_WITH]->(fof)-->(p)
RETURN fofQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+------------------------------+-----------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+------------------------------+-----------------------------+
| +ProduceResults | 0 | 0 | 0 | 2 | 1 | 0.6667 | p.name ASC | anon[30], anon[53], fof, p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+------------------------------+-----------------------------+
| +Filter | 0 | 0 | 0 | 2 | 1 | 0.6667 | p.name ASC | anon[30], anon[53], fof, p | not `anon[30]` = `anon[53]` |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+------------------------------+-----------------------------+
| +Expand(Into) | 0 | 0 | 0 | 2 | 1 | 0.6667 | p.name ASC | anon[30] -- anon[53], fof, p | (p)-[:FRIENDS_WITH]->(fof) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+------------------------------+-----------------------------+
| +Expand(All) | 0 | 0 | 1 | 2 | 1 | 0.6667 | p.name ASC | anon[53], fof -- p | (p)<--(fof) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+------------------------------+-----------------------------+
| +NodeIndexSeek | 1 | 1 | 3 | 2 | 1 | 0.6667 | p.name ASC | p | :Person(name) |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+------------------------------+-----------------------------+
Total database accesses: 4Optional Expand All
The OptionalExpand(All) operator is analogous to Expand(All), apart from when no relationships match the direction, type and property predicates.
In this situation, OptionalExpand(all) will return a single row with the relationship and end node set to null.
Query
MATCH (p:Person)
OPTIONAL MATCH (p)-[works_in:WORKS_IN]->(l)
WHERE works_in.duration > 180
RETURN p, lQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------------------------------------------+
| +ProduceResults | 14 | 15 | 0 | 33 | 0 | 1.0000 | l, p, works_in | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------------------------------------------+
| +OptionalExpand(All) | 14 | 15 | 44 | 33 | 0 | 1.0000 | l, works_in -- p | works_in.duration > $` AUTOINT0`; (p)-[works_in:WORKS_IN]->(l) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------------------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 34 | 0 | 1.0000 | p | :Person |
+----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------------------------------------------+
Total database accesses: 59Optional Expand Into
The OptionalExpand(Into) operator is analogous to Expand(Into), apart from when no matching relationships are found.
In this situation, OptionalExpand(Into) will return a single row with the relationship and end node set to null.
As both the start and end node of the relationship are already in scope, the node with the smallest degree will be used.
This can make a noticeable difference when dense nodes appear as end points.
Query
MATCH (p:Person)-[works_in:WORKS_IN]->(l)
OPTIONAL MATCH (l)-->(p)
RETURN pQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+------------------------------+
| +ProduceResults | 15 | 15 | 0 | 32 | 0 | 1.0000 | anon[61], l, p, works_in | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+------------------------------+
| +OptionalExpand(Into) | 15 | 15 | 48 | 32 | 0 | 1.0000 | anon[61] -- l, p, works_in | (l)-->(p) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+------------------------------+
| +Expand(All) | 15 | 15 | 29 | 32 | 0 | 1.0000 | l, works_in -- p | (p)-[works_in:WORKS_IN]->(l) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 33 | 0 | 1.0000 | p | :Person |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------+------------------------------+
Total database accesses: 92VarLength Expand All
Given a start node, the VarLengthExpand(All) operator will traverse variable-length relationships.
Query
MATCH (p:Person)-[:FRIENDS_WITH *1..2]-(q:Person)
RETURN p, qQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------+
| +ProduceResults | 4 | 6 | 0 | 21 | 0 | 1.0000 | anon[17], p, q | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------+
| +Filter | 4 | 6 | 6 | 21 | 0 | 1.0000 | anon[17], p, q | q:Person |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------+
| +VarLengthExpand(All) | 4 | 6 | 28 | 21 | 0 | 1.0000 | anon[17], q -- p | (p)-[:FRIENDS_WITH*..2]-(q) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 22 | 0 | 1.0000 | p | :Person |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------------------------+
Total database accesses: 49VarLength Expand Into
When both the start and end node have already been found, the VarLengthExpand(Into) operator is used to find all variable-length relationships connecting the two nodes.
Query
MATCH (p:Person)-[:FRIENDS_WITH *1..2]-(p:Person)
RETURN pQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+---------------+-----------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+---------------+-----------------------------+
| +ProduceResults | 0 | 0 | 0 | 19 | 0 | 1.0000 | anon[17], p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------+-----------------------------+
| +VarLengthExpand(Into) | 0 | 0 | 28 | 19 | 0 | 1.0000 | anon[17] -- p | (p)-[:FRIENDS_WITH*..2]-(p) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------+-----------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 20 | 0 | 1.0000 | p | :Person |
+------------------------+----------------+------+---------+-----------------+-------------------+----------------------+---------------+-----------------------------+
Total database accesses: 43VarLength Expand Pruning
Given a start node, the VarLengthExpand(Pruning) operator will traverse variable-length relationships much like the VarLengthExpand(All) operator.
However, as an optimization, some paths will not be explored if they are guaranteed to produce an end node that has already been found (by means of a previous path traversal).
This will only be used in cases where the individual paths are not of interest.
This operator guarantees that all the end nodes produced will be unique.
Query
MATCH (p:Person)-[:FRIENDS_WITH *3..4]-(q:Person)
RETURN DISTINCT p, qQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+---------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+---------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------+
| +ProduceResults | 0 | 0 | 0 | 21 | 0 | 1.0000 | p, q | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------+
| +Distinct | 0 | 0 | 0 | 21 | 0 | 1.0000 | p, q | p, q |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------+
| +Filter | 0 | 0 | 0 | 21 | 0 | 1.0000 | p, q | q:Person |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------+
| +VarLengthExpand(Pruning) | 0 | 0 | 32 | 21 | 0 | 1.0000 | q -- p | (p)-[:FRIENDS_WITH*3..4]-(q) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 22 | 0 | 1.0000 | p | :Person |
+---------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------+
Total database accesses: 47Assert Same Node
The AssertSameNode operator is used to ensure that no unique constraints are violated.
The example looks for the presence of a team with the supplied name and id, and if one does not exist,
it will be created. Owing to the existence of two unique constraints
on :Team(name) and :Team(id), any node that would be found by the UniqueIndexSeek
must be the very same node, or the constraints would be violated.
Query
MERGE (t:Team { name: 'Engineering', id: 42 })Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+---------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+---------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | | t | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| +EmptyResult | 1 | 0 | 0 | 0 | 0 | 0.0000 | | t | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| +AntiConditionalApply | 1 | 1 | 0 | 0 | 0 | 0.0000 | | t | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| | +MergeCreateNode | 1 | 0 | 0 | 0 | 0 | 0.0000 | | t | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| +Optional | 1 | 1 | 0 | 0 | 0 | 0.0000 | t.name ASC | t | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| +ActiveRead | 0 | 1 | 0 | 0 | 0 | 0.0000 | t.name ASC | t | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| +AssertSameNode | 0 | 1 | 0 | 0 | 1 | 0.0000 | t.name ASC | t | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| | +NodeUniqueIndexSeek(Locking) | 1 | 1 | 2 | 0 | 1 | 0.0000 | t.id ASC | t | :Team(id) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
| +NodeUniqueIndexSeek(Locking) | 1 | 1 | 2 | 0 | 2 | 0.0000 | t.name ASC | t | :Team(name) |
+---------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+-------------+
Total database accesses: 4Drop Result
The DropResult operator produces zero rows.
It is applied when it can be deduced through static analysis that the result of an expression will be empty, such as when a predicate guaranteed to return false (e.g. 1 > 5) is used in a query.
Query
MATCH (p)
WHERE FALSE RETURN pQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +ProduceResults | 0 | 0 | 0 | 0 | 0 | 0.0000 | p |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +DropResult | 0 | 0 | 0 | 0 | 0 | 0.0000 | p |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +AllNodesScan | 35 | 0 | 0 | 0 | 0 | 0.0000 | p |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
Total database accesses: 0Empty Result
The EmptyResult operator eagerly loads all incoming data and discards it.
Query
CREATE (:Person)Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | anon[8] |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +EmptyResult | 1 | 0 | 0 | 0 | 0 | 0.0000 | anon[8] |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +Create | 1 | 1 | 1 | 0 | 0 | 0.0000 | anon[8] |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
Total database accesses: 1Produce Results
The ProduceResults operator prepares the result so that it is consumable by the user, such as transforming internal values to user values.
It is present in every single query that returns data to the user, and has little bearing on performance optimisation.
Query
MATCH (n)
RETURN nQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +ProduceResults | 35 | 35 | 0 | 2 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +AllNodesScan | 35 | 35 | 36 | 3 | 0 | 1.0000 | n |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
Total database accesses: 36Load CSV
The LoadCSV operator loads data from a CSV source into the query.
It is used whenever the LOAD CSV clause is used in a query.
Query
LOAD CSV FROM 'https://neo4j.com/docs/cypher-refcard/3.3/csv/artists.csv' AS line
RETURN lineQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +ProduceResults | 1 | 4 | 0 | 0 | 0 | 0.0000 | line |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +LoadCSV | 1 | 4 | 0 | 0 | 0 | 0.0000 | line |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
Total database accesses: 0Hash joins in general
Hash joins have two inputs: the build input and probe input. The query planner assigns these roles so that the smaller of the two inputs is the build input. The build input is pulled in eagerly, and is used to build a probe table. Once this is complete, the probe table is checked for each row coming from the probe input side.
In query plans, the build input is always the left operator, and the probe input the right operator.
There are four hash join operators:
Node Hash Join
The NodeHashJoin operator is a variation of the hash join.
NodeHashJoin executes the hash join on node ids.
As primitive types and arrays can be used, it can be done very efficiently.
Query
MATCH (bob:Person { name:'Bob' })-[:WORKS_IN]->(loc)<-[:WORKS_IN]-(matt:Person { name:'Mattis' })
RETURN loc.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+---------------+------------------------------------------------+-----------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+---------------+------------------------------------------------+-----------------------------+
| +ProduceResults | 10 | 0 | 0 | 0 | 0 | 0.0000 | matt.name ASC | anon[32], anon[51], bob, loc, loc.name, matt | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------+------------------------------------------------+-----------------------------+
| +Projection | 10 | 0 | 0 | 0 | 0 | 0.0000 | matt.name ASC | loc.name -- anon[32], anon[51], bob, loc, matt | {loc.name : loc.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------+------------------------------------------------+-----------------------------+
| +Filter | 10 | 0 | 0 | 0 | 0 | 0.0000 | matt.name ASC | anon[32], anon[51], bob, loc, matt | not `anon[32]` = `anon[51]` |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------+------------------------------------------------+-----------------------------+
| +NodeHashJoin | 10 | 0 | 0 | 3 | 1 | 0.7500 | matt.name ASC | anon[32], bob -- anon[51], loc, matt | loc |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+---------------+------------------------------------------------+-----------------------------+
| | +Expand(All) | 19 | 0 | 0 | 1 | 0 | 1.0000 | matt.name ASC | anon[51], loc -- matt | (matt)-[:WORKS_IN]->(loc) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+---------------+------------------------------------------------+-----------------------------+
| | +NodeIndexSeek | 1 | 0 | 2 | 1 | 0 | 1.0000 | matt.name ASC | matt | :Person(name) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------+------------------------------------------------+-----------------------------+
| +Expand(All) | 19 | 0 | 1 | 0 | 0 | 0.0000 | bob.name ASC | anon[32], loc -- bob | (bob)-[:WORKS_IN]->(loc) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------+------------------------------------------------+-----------------------------+
| +NodeIndexSeek | 1 | 1 | 3 | 0 | 0 | 0.0000 | bob.name ASC | bob | :Person(name) |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+---------------+------------------------------------------------+-----------------------------+
Total database accesses: 6Value Hash Join
The ValueHashJoin operator is a variation of the hash join.
This operator allows for arbitrary values to be used as the join key.
It is most frequently used to solve predicates of the form: n.prop1 = m.prop2 (i.e. equality predicates between two property columns).
Query
MATCH (p:Person),(q:Person)
WHERE p.age = q.age
RETURN p,qQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| +ProduceResults | 0 | 0 | 0 | 0 | 0 | 0.0000 | p, q | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| +ValueHashJoin | 0 | 0 | 28 | 1 | 0 | 1.0000 | p -- q | p.age = q.age |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| | +NodeByLabelScan | 14 | 14 | 15 | 1 | 0 | 1.0000 | q | :Person |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| +NodeByLabelScan | 14 | 14 | 15 | 2 | 0 | 1.0000 | p | :Person |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
Total database accesses: 58Node Left/Right Outer Hash Join
The NodeLeftOuterHashJoin and NodeRightOuterHashJoin operators are variations of the hash join.
The query below can be planned with either a left or a right outer join.
The decision depends on the cardinalities of the left-hand and right-hand sides; i.e. how many rows would be returned, respectively, for (a:Person) and (a)-→(b:Person).
If (a:Person) returns fewer results than (a)-→(b:Person), a left outer join — indicated by NodeLeftOuterHashJoin — is planned.
On the other hand, if (a:Person) returns more results than (a)-→(b:Person), a right outer join — indicated by NodeRightOuterHashJoin — is planned instead.
Query
MATCH (a:Person)
OPTIONAL MATCH (a)-->(b:Person)
USING JOIN ON a
RETURN a.name, b.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-------------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-------------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+------------------------------------+
| +ProduceResults | 14 | 14 | 0 | 1 | 0 | 1.0000 | anon[36], a, a.name, b, b.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+------------------------------------+
| +Projection | 14 | 14 | 16 | 1 | 0 | 1.0000 | a.name, b.name -- anon[36], a, b | {a.name : a.name, b.name : b.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+------------------------------------+
| +NodeRightOuterHashJoin | 14 | 14 | 0 | 17 | 0 | 1.0000 | anon[36], b -- a | a |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+------------------------------------+
| | +NodeByLabelScan | 14 | 14 | 15 | 17 | 0 | 1.0000 | a | :Person |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+------------------------------------+
| +Expand(All) | 2 | 2 | 16 | 16 | 0 | 1.0000 | anon[36], a -- b | (b)<--(a) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+------------------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 17 | 0 | 1.0000 | b | :Person |
+-------------------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------------------+------------------------------------+
Total database accesses: 62Triadic Selection
The TriadicSelection operator is used to solve triangular queries, such as the very
common 'find my friend-of-friends that are not already my friend'.
It does so by putting all the friends into a set, and uses the set to check if the
friend-of-friends are already connected to me.
The example finds the names of all friends of my friends that are not already my friends.
Query
MATCH (me:Person)-[:FRIENDS_WITH]-()-[:FRIENDS_WITH]-(other)
WHERE NOT (me)-[:FRIENDS_WITH]-(other)
RETURN other.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------------------------------+-----------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------------------------------+-----------------------------+
| +ProduceResults | 0 | 2 | 0 | 20 | 0 | 1.0000 | anon[18], anon[35], anon[37], me, other, other.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------------------------------+-----------------------------+
| +Projection | 0 | 2 | 2 | 20 | 0 | 1.0000 | other.name -- anon[18], anon[35], anon[37], me, other | {other.name : other.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------------------------------+-----------------------------+
| +TriadicSelection | 0 | 2 | 0 | 20 | 0 | 1.0000 | anon[18], anon[35], anon[37], me, other | me, anon[35], other |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------------------------------+-----------------------------+
| | +Filter | 0 | 2 | 0 | 1 | 0 | 1.0000 | anon[18], anon[35], anon[37], me, other | not `anon[18]` = `anon[37]` |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------------------------------+-----------------------------+
| | +Expand(All) | 0 | 6 | 10 | 1 | 0 | 1.0000 | anon[37], other -- anon[18], anon[35], me | ()-[:FRIENDS_WITH]-(other) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------------------------------+-----------------------------+
| | +Argument | 4 | 4 | 0 | 1 | 0 | 1.0000 | anon[18], anon[35], me | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------------------------------+-----------------------------+
| +Expand(All) | 4 | 4 | 18 | 19 | 0 | 1.0000 | anon[18], anon[35] -- me | (me)-[:FRIENDS_WITH]-() |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------------------------------+-----------------------------+
| +NodeByLabelScan | 14 | 14 | 15 | 20 | 0 | 1.0000 | me | :Person |
+-------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------------------------------------------+-----------------------------+
Total database accesses: 45Cartesian Product
The CartesianProduct operator produces a cartesian product of the two inputs — each row coming from the left child operator will be combined with all the rows from the right child operator.
CartesianProduct generally exhibits bad performance and ought to be avoided if possible.
Query
MATCH (p:Person),(t:Team)
RETURN p, tQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +ProduceResults | 140 | 140 | 0 | 12 | 0 | 1.0000 | p, t | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +CartesianProduct | 140 | 140 | 0 | 13 | 0 | 1.0000 | t -- p | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| | +NodeByLabelScan | 14 | 140 | 150 | 1 | 0 | 1.0000 | p | :Person |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +NodeByLabelScan | 10 | 10 | 11 | 13 | 0 | 1.0000 | t | :Team |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
Total database accesses: 161Foreach
The Foreach operator executes a nested loop between the left child operator and the right child operator.
In an analogous manner to the Apply operator, it takes a row from the left-hand side and, using the Argument operator, provides it to the operator tree on the right-hand side.
Foreach will yield all the rows coming in from the left-hand side; all results from the right-hand side are pulled in and discarded.
Query
FOREACH (value IN [1,2,3]| CREATE (:Person { age: value }))Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| +EmptyResult | 1 | 0 | 0 | 0 | 0 | 0.0000 | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| +Foreach | 1 | 1 | 0 | 0 | 0 | 0.0000 | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| | +Create | 1 | 3 | 9 | 0 | 0 | 0.0000 | anon[36] -- value |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| | +Argument | 1 | 3 | 0 | 0 | 0 | 0.0000 | value |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| +EmptyRow | 1 | 1 | 0 | 0 | 0 | 0.0000 | |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
Total database accesses: 9Eager
For isolation purposes, the Eager operator ensures that operations affecting subsequent operations are executed fully for the whole dataset before continuing execution.
Information from the stores is fetched in a lazy manner; i.e. the pattern matching might not be fully exhausted before updates are applied.
To guarantee reasonable semantics, the query planner will insert Eager operators into the query plan to prevent updates from influencing pattern matching;
this scenario is exemplified by the query below, where the DELETE clause influences the MATCH clause.
The Eager operator can cause high memory usage when importing data or migrating graph structures.
In such cases, the operations should be split into simpler steps; e.g. importing nodes and relationships separately.
Alternatively, the records to be updated can be returned, followed by an update statement.
Query
MATCH (a)-[r]-(b)
DELETE r,a,b
MERGE ()Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-------------------------+----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-------------------------+----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | anon[38], a, b, r | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| +EmptyResult | 1 | 0 | 0 | 0 | 0 | 0.0000 | anon[38], a, b, r | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| +Apply | 1 | 504 | 0 | 0 | 0 | 0.0000 | a, b, r -- anon[38] | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| | +AntiConditionalApply | 1 | 504 | 0 | 0 | 0 | 0.0000 | anon[38] | |
| | |\ +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| | | +MergeCreateNode | 1 | 0 | 0 | 0 | 0 | 0.0000 | anon[38] | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| | +Optional | 35 | 504 | 0 | 0 | 0 | 0.0000 | anon[38] | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| | +ActiveRead | 35 | 504 | 0 | 0 | 0 | 0.0000 | anon[38] | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| | +AllNodesScan | 35 | 504 | 540 | 0 | 0 | 0.0000 | anon[38] | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| +Eager | 36 | 36 | 0 | -5 | 0 | 1.0000 | a, b, r | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| +Delete(3) | 36 | 36 | 39 | -15 | 0 | 3.0000 | a, b, r | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| +Eager | 36 | 36 | 0 | 17 | 0 | 1.0000 | a, b, r | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| +Expand(All) | 36 | 36 | 71 | 22 | 0 | 1.0000 | b, r -- a | (a)-[r:]-(b) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
| +AllNodesScan | 35 | 35 | 36 | 23 | 0 | 1.0000 | a | |
+-------------------------+----------------+------+---------+-----------------+-------------------+----------------------+---------------------+--------------+
Total database accesses: 686Eager Aggregation
The EagerAggregation operator evaluates a grouping expression and uses the result to group rows into different groupings.
For each of these groupings, EagerAggregation will then evaluate all aggregation functions and return the result.
To do this, EagerAggregation, as the name implies, needs to pull in all data eagerly from its source and build up state, which leads to increased memory pressure in the system.
Query
MATCH (l:Location)<-[:WORKS_IN]-(p:Person)
RETURN l.name AS location, collect(p.name) AS peopleQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| +ProduceResults | 4 | 6 | 0 | 0 | 0 | 0.0000 | location, people | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| +EagerAggregation | 4 | 6 | 30 | 8 | 0 | 1.0000 | location, people | location |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| +Filter | 15 | 15 | 15 | 8 | 0 | 1.0000 | anon[19], l, p | p:Person |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| +Expand(All) | 15 | 15 | 25 | 8 | 0 | 1.0000 | anon[19], p -- l | (l)<-[:WORKS_IN]-(p) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| +NodeByLabelScan | 10 | 10 | 11 | 9 | 0 | 1.0000 | l | :Location |
+-------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
Total database accesses: 81Node Count From Count Store
The NodeCountFromCountStore operator uses the count store to answer questions about node counts.
This is much faster than the EagerAggregation operator which achieves the same result by actually counting.
However, as the count store only stores a limited range of combinations, EagerAggregation will still be used for more complex queries.
For example, we can get counts for all nodes, and nodes with a label, but not nodes with more than one label.
Query
MATCH (p:Person)
RETURN count(p) AS peopleQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+--------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+--------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------------+
| +ProduceResults | 1 | 1 | 0 | 0 | 0 | 0.0000 | people | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------------+
| +NodeCountFromCountStore | 1 | 1 | 1 | 0 | 0 | 0.0000 | people | count( (:Some(Person)) ) AS people |
+--------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+------------------------------------+
Total database accesses: 1Relationship Count From Count Store
The RelationshipCountFromCountStore operator uses the count store to answer questions about relationship counts.
This is much faster than the EagerAggregation operator which achieves the same result by actually counting.
However, as the count store only stores a limited range of combinations, EagerAggregation will still be used for more complex queries.
For example, we can get counts for all relationships, relationships with a type, relationships with a label on one end, but not relationships with labels on both end nodes.
Query
MATCH (p:Person)-[r:WORKS_IN]->()
RETURN count(r) AS jobsQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+----------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+--------------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+----------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+--------------------------------------------+
| +ProduceResults | 1 | 1 | 0 | 0 | 0 | 0.0000 | jobs | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+--------------------------------------------+
| +RelationshipCountFromCountStore | 1 | 1 | 2 | 0 | 0 | 0.0000 | jobs | count( (:Person)-[:WORKS_IN]->() ) AS jobs |
+----------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+--------------------------------------------+
Total database accesses: 2Distinct
The Distinct operator removes duplicate rows from the incoming stream of rows.
To ensure only distinct elements are returned, Distinct will pull in data lazily from its source and build up state.
This may lead to increased memory pressure in the system.
Query
MATCH (l:Location)<-[:WORKS_IN]-(p:Person)
RETURN DISTINCT lQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| +ProduceResults | 14 | 6 | 0 | 9 | 0 | 1.0000 | l | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| +Distinct | 14 | 6 | 0 | 9 | 0 | 1.0000 | l | l |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| +Filter | 15 | 15 | 15 | 9 | 0 | 1.0000 | anon[19], l, p | p:Person |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| +Expand(All) | 15 | 15 | 25 | 9 | 0 | 1.0000 | anon[19], p -- l | (l)<-[:WORKS_IN]-(p) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
| +NodeByLabelScan | 10 | 10 | 11 | 10 | 0 | 1.0000 | l | :Location |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+----------------------+
Total database accesses: 51Filter
The Filter operator filters each row coming from the child operator, only passing through rows that evaluate the predicates to true.
Query
MATCH (p:Person)
WHERE p.name =~ '^a.*'
RETURN pQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+------------------------------------+
| +ProduceResults | 14 | 0 | 0 | 0 | 0 | 0.0000 | cached[p.name], p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+------------------------------------+
| +Filter | 14 | 0 | 0 | 0 | 0 | 0.0000 | cached[p.name], p | cached[p.name] =~ $` AUTOSTRING0` |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+------------------------------------+
| +NodeIndexScan | 14 | 14 | 16 | 0 | 1 | 0.0000 | cached[p.name], p | :Person(name) |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+------------------------------------+
Total database accesses: 16Limit
The Limit operator returns the first 'n' rows from the incoming input.
Query
MATCH (p:Person)
RETURN p
LIMIT 3Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +ProduceResults | 3 | 3 | 0 | 2 | 0 | 1.0000 | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +Limit | 3 | 3 | 0 | 2 | 0 | 1.0000 | p | 3 |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +NodeByLabelScan | 14 | 3 | 4 | 0 | 0 | 0.0000 | p | :Person |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
Total database accesses: 4Skip
The Skip operator skips 'n' rows from the incoming rows.
Query
MATCH (p:Person)
RETURN p
ORDER BY p.id
SKIP 1Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+---------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+---------------+
| +ProduceResults | 14 | 13 | 0 | 2 | 0 | 1.0000 | anon[59] ASC | anon[59], p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+---------------+
| +Skip | 14 | 13 | 0 | 2 | 0 | 1.0000 | anon[59] ASC | anon[59], p | $` AUTOINT0` |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+---------------+
| +Sort | 14 | 14 | 0 | 4 | 0 | 1.0000 | anon[59] ASC | anon[59], p | anon[59] |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+---------------+
| +Projection | 14 | 14 | 14 | 2 | 0 | 1.0000 | | anon[59] -- p | { : p.id} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+---------------+
| +NodeByLabelScan | 14 | 14 | 15 | 3 | 0 | 1.0000 | | p | :Person |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+---------------+
Total database accesses: 29Sort
The Sort operator sorts rows by a provided key.
In order to sort the data, all data from the source operator needs to be pulled in eagerly and kept in the query state, which will lead to increased memory pressure in the system.
Query
MATCH (p:Person)
RETURN p
ORDER BY p.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
| +ProduceResults | 14 | 14 | 0 | 2 | 0 | 1.0000 | anon[37] ASC | anon[37], p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
| +Sort | 14 | 14 | 0 | 4 | 0 | 1.0000 | anon[37] ASC | anon[37], p | anon[37] |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
| +Projection | 14 | 14 | 14 | 2 | 0 | 1.0000 | | anon[37] -- p | { : p.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
| +NodeByLabelScan | 14 | 14 | 15 | 3 | 0 | 1.0000 | | p | :Person |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
Total database accesses: 29Top
The Top operator returns the first 'n' rows sorted by a provided key. Instead of sorting the entire input, only the top 'n' rows are retained.
Query
MATCH (p:Person)
RETURN p
ORDER BY p.name
LIMIT 2Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
| +ProduceResults | 2 | 2 | 0 | 2 | 0 | 1.0000 | anon[37] ASC | anon[37], p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
| +Top | 2 | 2 | 0 | 4 | 0 | 1.0000 | anon[37] ASC | anon[37], p | anon[37]; 2 |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
| +Projection | 14 | 14 | 14 | 2 | 0 | 1.0000 | | anon[37] -- p | { : p.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
| +NodeByLabelScan | 14 | 14 | 15 | 3 | 0 | 1.0000 | | p | :Person |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------+---------------+-------------+
Total database accesses: 29Union
The Union operator concatenates the results from the right child operator with the results from the left child operator.
Query
MATCH (p:Location)
RETURN p.name
UNION ALL MATCH (p:Country)
RETURN p.nameQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------+---------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------+---------------------+
| +ProduceResults | 10 | 11 | 0 | 3 | 0 | 1.0000 | p.name | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------+---------------------+
| +Union | 10 | 11 | 0 | 4 | 0 | 1.0000 | p.name | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------+---------------------+
| | +Projection | 1 | 1 | 1 | 0 | 0 | 0.0000 | p.name -- p | {p.name : `p`.name} |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------+---------------------+
| | +NodeByLabelScan | 1 | 1 | 2 | 1 | 0 | 1.0000 | p | :Country |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------+---------------------+
| +Projection | 10 | 10 | 10 | 2 | 0 | 1.0000 | p.name -- p | {p.name : `p`.name} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------+---------------------+
| +NodeByLabelScan | 10 | 10 | 11 | 3 | 0 | 1.0000 | p | :Location |
+--------------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------+---------------------+
Total database accesses: 24Unwind
The Unwind operator returns one row per item in a list.
Query
UNWIND range(1, 5) AS value
RETURN valueQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-------------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-------------------------------------+
| +ProduceResults | 10 | 5 | 0 | 0 | 0 | 0.0000 | value | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+-------------------------------------+
| +Unwind | 10 | 5 | 0 | 0 | 0 | 0.0000 | value | range($` AUTOINT0`, $` AUTOINT1`) |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-------------------------------------+
Total database accesses: 0Lock Nodes
The LockNodes operator locks the start and end node when creating a relationship.
Query
MATCH (s:Person { name: 'me' })
MERGE (s)-[:FRIENDS_WITH]->(s)Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | | anon[40], s | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +EmptyResult | 1 | 0 | 0 | 5 | 1 | 0.8333 | | anon[40], s | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +Apply | 1 | 1 | 0 | 5 | 1 | 0.8333 | s.name ASC | anon[40], s | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +AntiConditionalApply | 1 | 1 | 0 | 3 | 0 | 1.0000 | | anon[40], s | |
| | |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +MergeCreateRelationship | 1 | 1 | 1 | 2 | 0 | 1.0000 | | anon[40] -- s | |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Argument | 1 | 1 | 0 | 2 | 0 | 1.0000 | | s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +AntiConditionalApply | 1 | 1 | 0 | 3 | 0 | 1.0000 | | anon[40], s | |
| | |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Optional | 1 | 1 | 0 | 3 | 0 | 1.0000 | | anon[40], s | |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +ActiveRead | 0 | 0 | 0 | 1 | 0 | 1.0000 | | anon[40], s | |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Expand(Into) | 0 | 0 | 4 | 1 | 0 | 1.0000 | | anon[40] -- s | (s)-[:FRIENDS_WITH]->(s) |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +LockNodes | 1 | 1 | 0 | 1 | 0 | 1.0000 | | s | s |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Argument | 1 | 1 | 0 | 1 | 0 | 1.0000 | | s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +Optional | 1 | 1 | 0 | 5 | 0 | 1.0000 | | anon[40], s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +ActiveRead | 0 | 0 | 0 | 2 | 0 | 1.0000 | | anon[40], s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +Expand(Into) | 0 | 0 | 4 | 2 | 0 | 1.0000 | | anon[40] -- s | (s)-[:FRIENDS_WITH]->(s) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +Argument | 1 | 1 | 0 | 2 | 0 | 1.0000 | | s | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +NodeIndexSeek | 1 | 1 | 3 | 5 | 1 | 0.8333 | s.name ASC | s | :Person(name) |
+------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
Total database accesses: 12Optional
The Optional operator is used to solve some OPTIONAL MATCH queries.
It will pull data from its source, simply passing it through if any data exists.
However, if no data is returned by its source, Optional will yield a single row with all columns set to null.
Query
MATCH (p:Person { name:'me' })
OPTIONAL MATCH (q:Person { name: 'Lulu' })
RETURN p, qQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +ProduceResults | 1 | 1 | 0 | 3 | 1 | 0.7500 | p.name ASC | p, q | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +Apply | 1 | 1 | 0 | 3 | 1 | 0.7500 | p.name ASC | p -- q | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| | +Optional | 1 | 1 | 0 | 3 | 0 | 1.0000 | q.name ASC | q | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| | +NodeIndexSeek | 1 | 0 | 2 | 1 | 0 | 1.0000 | q.name ASC | q | :Person(name) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
| +NodeIndexSeek | 1 | 1 | 3 | 3 | 1 | 0.7500 | p.name ASC | p | :Person(name) |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+-----------+---------------+
Total database accesses: 5Project Endpoints
The ProjectEndpoints operator projects the start and end node of a relationship.
Query
CREATE (n)-[p:KNOWS]->(m)
WITH p AS r
MATCH (u)-[r]->(v)
RETURN u, vQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+---------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------------+---------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+---------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------------+---------+
| +ProduceResults | 18 | 1 | 0 | 0 | 0 | 0.0000 | m, n, p, r, u, v | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------------+---------+
| +Apply | 18 | 1 | 0 | 0 | 0 | 0.0000 | m, n, p -- r, u, v | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+--------------------+---------+
| | +ProjectEndpoints | 18 | 1 | 0 | 0 | 0 | 0.0000 | u, v -- r | r, u, v |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+--------------------+---------+
| | +Argument | 1 | 1 | 0 | 0 | 0 | 0.0000 | r | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------------+---------+
| +Projection | 1 | 1 | 0 | 0 | 0 | 0.0000 | r -- m, n, p | {r : p} |
| | +----------------+------+---------+-----------------+-------------------+----------------------+--------------------+---------+
| +Create | 1 | 1 | 4 | 0 | 0 | 0.0000 | m, n, p | |
+---------------------+----------------+------+---------+-----------------+-------------------+----------------------+--------------------+---------+
Total database accesses: 4Projection
For each incoming row, the Projection operator evaluates a set of expressions and produces a row with the results of the expressions.
Query
RETURN 'hello' AS greetingQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-------------------------------+
| +ProduceResults | 1 | 1 | 0 | 0 | 0 | 0.0000 | greeting | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+-------------------------------+
| +Projection | 1 | 1 | 0 | 0 | 0 | 0.0000 | greeting | {greeting : $` AUTOSTRING0`} |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-------------------------------+
Total database accesses: 0Empty Row
The EmptyRow operator returns a single row with no columns.
Query
FOREACH (value IN [1,2,3]| CREATE (:Person { age: value }))Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| +EmptyResult | 1 | 0 | 0 | 0 | 0 | 0.0000 | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| +Foreach | 1 | 1 | 0 | 0 | 0 | 0.0000 | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| | +Create | 1 | 3 | 9 | 0 | 0 | 0.0000 | anon[36] -- value |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| | +Argument | 1 | 3 | 0 | 0 | 0 | 0.0000 | value |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
| +EmptyRow | 1 | 1 | 0 | 0 | 0 | 0.0000 | |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-------------------+
Total database accesses: 9Procedure Call
The ProcedureCall operator indicates an invocation to a procedure.
Query
CALL db.labels() YIELD label
RETURN *
ORDER BY labelQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-----------+----------------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-----------+----------------------------------+
| +ProduceResults | 10000 | 4 | 0 | 0 | 0 | 0.0000 | label ASC | label | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+-----------+----------------------------------+
| +Sort | 10000 | 4 | 0 | 0 | 0 | 0.0000 | label ASC | label | label |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+-----------+----------------------------------+
| +ProcedureCall | 10000 | 4 | 1 | 0 | 0 | 0.0000 | | label | db.labels() :: (label :: String) |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+-----------+----------------------------------+
Total database accesses: 1Create Nodes / Relationships
The Create operator is used to create nodes and relationships.
Query
CREATE (max:Person { name: 'Max' }),(chris:Person { name: 'Chris' })
CREATE (max)-[:FRIENDS_WITH]->(chris)Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | anon[79], chris, max |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------+
| +EmptyResult | 1 | 0 | 0 | 0 | 0 | 0.0000 | anon[79], chris, max |
| | +----------------+------+---------+-----------------+-------------------+----------------------+----------------------+
| +Create | 1 | 1 | 8 | 0 | 0 | 0.0000 | anon[79], chris, max |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+----------------------+
Total database accesses: 8Delete
The Delete operator is used to delete a node or a relationship.
Query
MATCH (me:Person { name: 'me' })-[w:WORKS_IN { duration: 190 }]->(london:Location { name: 'London' })
DELETE wQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+-------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
| +ProduceResults | 0 | 0 | 0 | 0 | 0 | 0.0000 | | london, me, w | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
| +EmptyResult | 0 | 0 | 0 | -4 | -2 | 0.6667 | | london, me, w | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
| +Delete | 0 | 1 | 1 | -4 | -2 | 0.6667 | me.name ASC | london, me, w | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
| +Eager | 0 | 1 | 0 | 0 | 0 | 0.0000 | me.name ASC | london, me, w | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
| +Filter | 0 | 1 | 1 | 4 | 2 | 0.6667 | me.name ASC | london, me, w | w.duration = $` AUTOINT1` |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
| +Expand(Into) | 0 | 1 | 4 | 4 | 2 | 0.6667 | me.name ASC | w -- london, me | (me)-[w:WORKS_IN]->(london) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
| +CartesianProduct | 1 | 1 | 0 | 4 | 2 | 0.6667 | me.name ASC | me -- london | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
| | +NodeIndexSeek | 1 | 1 | 3 | 4 | 1 | 0.8000 | london.name ASC | london | :Location(name) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
| +NodeIndexSeek | 1 | 1 | 3 | 4 | 2 | 0.6667 | me.name ASC | me | :Person(name) |
+-------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------------+-----------------+-----------------------------+
Total database accesses: 12Detach Delete
The DetachDelete operator is used in all queries containing the DETACH DELETE clause, when deleting nodes and their relationships.
Query
MATCH (p:Person)
DETACH DELETE pQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +ProduceResults | 14 | 0 | 0 | 0 | 0 | 0.0000 | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +EmptyResult | 14 | 0 | 0 | 41 | 0 | 1.0000 | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +DetachDelete | 14 | 14 | 0 | 41 | 0 | 1.0000 | p | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
| +NodeByLabelScan | 14 | 14 | 15 | 42 | 0 | 1.0000 | p | :Person |
+------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------+
Total database accesses: 15Merge Create Node
The MergeCreateNode operator is used when creating a node as a result of a MERGE clause failing to find the node.
Query
MERGE (:Person { name: 'Sally' })Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------+---------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------+---------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | | anon[7] | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------+---------------+
| +EmptyResult | 1 | 0 | 0 | 0 | 0 | 0.0000 | | anon[7] | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------+---------------+
| +AntiConditionalApply | 1 | 1 | 0 | 0 | 0 | 0.0000 | | anon[7] | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------+---------------+
| | +MergeCreateNode | 1 | 1 | 3 | 0 | 0 | 0.0000 | | anon[7] | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------+---------------+
| +Optional | 1 | 1 | 0 | 0 | 1 | 0.0000 | anon[7].name ASC | anon[7] | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------+---------------+
| +ActiveRead | 1 | 0 | 0 | 0 | 1 | 0.0000 | anon[7].name ASC | anon[7] | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------+---------------+
| +NodeIndexSeek | 1 | 0 | 2 | 0 | 1 | 0.0000 | anon[7].name ASC | anon[7] | :Person(name) |
+-----------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------------+-----------+---------------+
Total database accesses: 5Merge Create Relationship
The MergeCreateRelationship operator is used when creating a relationship as a result of a MERGE clause failing to find the relationship.
Query
MATCH (s:Person { name: 'Sally' })
MERGE (s)-[:FRIENDS_WITH]->(s)Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Order | Variables | Other |
+------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +ProduceResults | 1 | 0 | 0 | 0 | 0 | 0.0000 | | anon[43], s | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +EmptyResult | 1 | 0 | 0 | 0 | 1 | 0.0000 | | anon[43], s | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +Apply | 1 | 0 | 0 | 0 | 1 | 0.0000 | s.name ASC | anon[43], s | |
| |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +AntiConditionalApply | 1 | 0 | 0 | 0 | 0 | 0.0000 | | anon[43], s | |
| | |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +MergeCreateRelationship | 1 | 0 | 0 | 0 | 0 | 0.0000 | | anon[43] -- s | |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Argument | 1 | 0 | 0 | 0 | 0 | 0.0000 | | s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +AntiConditionalApply | 1 | 0 | 0 | 0 | 0 | 0.0000 | | anon[43], s | |
| | |\ +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Optional | 1 | 0 | 0 | 0 | 0 | 0.0000 | | anon[43], s | |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +ActiveRead | 0 | 0 | 0 | 0 | 0 | 0.0000 | | anon[43], s | |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Expand(Into) | 0 | 0 | 0 | 0 | 0 | 0.0000 | | anon[43] -- s | (s)-[:FRIENDS_WITH]->(s) |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +LockNodes | 1 | 0 | 0 | 0 | 0 | 0.0000 | | s | s |
| | | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | | +Argument | 1 | 0 | 0 | 0 | 0 | 0.0000 | | s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +Optional | 1 | 0 | 0 | 0 | 0 | 0.0000 | | anon[43], s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +ActiveRead | 0 | 0 | 0 | 0 | 0 | 0.0000 | | anon[43], s | |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +Expand(Into) | 0 | 0 | 0 | 0 | 0 | 0.0000 | | anon[43] -- s | (s)-[:FRIENDS_WITH]->(s) |
| | | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| | +Argument | 1 | 0 | 0 | 0 | 0 | 0.0000 | | s | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
| +NodeIndexSeek | 1 | 0 | 2 | 0 | 1 | 0.0000 | s.name ASC | s | :Person(name) |
+------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+------------+---------------+--------------------------+
Total database accesses: 2Set Labels
The SetLabels operator is used when setting labels on a node.
Query
MATCH (n)
SET n:PersonQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +ProduceResults | 35 | 0 | 0 | 0 | 0 | 0.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +EmptyResult | 35 | 0 | 0 | 2 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +SetLabels | 35 | 35 | 35 | 2 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +AllNodesScan | 35 | 35 | 36 | 3 | 0 | 1.0000 | n |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
Total database accesses: 71Remove Labels
The RemoveLabels operator is used when deleting labels from a node.
Query
MATCH (n)
REMOVE n:PersonQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +ProduceResults | 35 | 0 | 0 | 0 | 0 | 0.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +EmptyResult | 35 | 0 | 0 | 2 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +RemoveLabels | 35 | 35 | 35 | 2 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +AllNodesScan | 35 | 35 | 36 | 3 | 0 | 1.0000 | n |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
Total database accesses: 71Set Node Properties From Map
The SetNodePropertiesFromMap operator is used when setting properties from a map on a node.
Query
MATCH (n)
SET n = { weekday: 'Monday', meal: 'Lunch' }Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+---------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+---------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +ProduceResults | 35 | 0 | 0 | 0 | 0 | 0.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +EmptyResult | 35 | 0 | 0 | 3 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +SetNodePropertiesFromMap | 35 | 35 | 141 | 3 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +AllNodesScan | 35 | 35 | 36 | 4 | 0 | 1.0000 | n |
+---------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
Total database accesses: 177Set Relationship Properties From Map
The SetRelationshipPropertiesFromMap operator is used when setting properties from a map on a relationship.
Query
MATCH (n)-[r]->(m)
SET r = { weight: 5, unit: 'kg' }Query Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables | Other |
+-----------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| +ProduceResults | 18 | 0 | 0 | 0 | 0 | 0.0000 | m, n, r | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| +EmptyResult | 18 | 0 | 0 | 39 | 0 | 1.0000 | m, n, r | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| +SetRelationshipPropertiesFromMap | 18 | 18 | 69 | 39 | 0 | 1.0000 | m, n, r | |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| +Expand(All) | 18 | 18 | 53 | 39 | 0 | 1.0000 | n, r -- m | (m)<-[r:]-(n) |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
| +AllNodesScan | 35 | 35 | 36 | 40 | 0 | 1.0000 | m | |
+-----------------------------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+---------------+
Total database accesses: 158Set Property
The SetProperty operator is used when setting a property on a node or relationship.
Query
MATCH (n)
SET n.checked = TRUEQuery Plan
Compiler CYPHER 3.5
Planner COST
Runtime INTERPRETED
Runtime version 3.5
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| Operator | Estimated Rows | Rows | DB Hits | Page Cache Hits | Page Cache Misses | Page Cache Hit Ratio | Variables |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +ProduceResults | 35 | 0 | 0 | 0 | 0 | 0.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +EmptyResult | 35 | 0 | 0 | 1 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +SetProperty | 35 | 35 | 38 | 1 | 0 | 1.0000 | n |
| | +----------------+------+---------+-----------------+-------------------+----------------------+-----------+
| +AllNodesScan | 35 | 35 | 36 | 2 | 0 | 1.0000 | n |
+-----------------+----------------+------+---------+-----------------+-------------------+----------------------+-----------+
Total database accesses: 74Create Unique Constraint
The CreateUniqueConstraint operator creates a unique constraint on a property for all nodes having a certain label.
The following query will create a unique constraint on the name property of nodes with the Country label.
Query
CREATE CONSTRAINT ON (c:Country) ASSERT c.name IS UNIQUEQuery Plan
Compiler CYPHER 3.5
Planner PROCEDURE
Runtime PROCEDURE
Runtime version 3.5
+---------------------------------+
| Operator |
+---------------------------------+
| +CreateUniquePropertyConstraint |
+---------------------------------+
Total database accesses: ?Drop Unique Constraint
The DropUniqueConstraint operator removes a unique constraint from a property for all nodes having a certain label.
The following query will drop a unique constraint on the name property of nodes with the Country label.
Query
DROP CONSTRAINT ON (c:Country) ASSERT c.name IS UNIQUEQuery Plan
Compiler CYPHER 3.5
Planner PROCEDURE
Runtime PROCEDURE
Runtime version 3.5
+-------------------------------+
| Operator |
+-------------------------------+
| +DropUniquePropertyConstraint |
+-------------------------------+
Total database accesses: ?Create Node Property Existence Constraint
The CreateNodePropertyExistenceConstraint operator creates an existence constraint on a property for all nodes having a certain label.
This will only appear in Enterprise Edition.
Query
CREATE CONSTRAINT ON (p:Person) ASSERT exists(p.name)Query Plan
Compiler CYPHER 3.5
Planner PROCEDURE
Runtime PROCEDURE
Runtime version 3.5
+----------------------------------------+
| Operator |
+----------------------------------------+
| +CreateNodePropertyExistenceConstraint |
+----------------------------------------+
Total database accesses: ?Drop Node Property Existence Constraint
The DropNodePropertyExistenceConstraint operator removes an existence constraint from a property for all nodes having a certain label.
This will only appear in Enterprise Edition.
Query
DROP CONSTRAINT ON (p:Person) ASSERT exists(p.name)Query Plan
Compiler CYPHER 3.5
Planner PROCEDURE
Runtime PROCEDURE
Runtime version 3.5
+--------------------------------------+
| Operator |
+--------------------------------------+
| +DropNodePropertyExistenceConstraint |
+--------------------------------------+
Total database accesses: ?Create Node Key Constraint
The CreateNodeKeyConstraint operator creates a Node Key which ensures that all nodes with a particular label have a set of defined properties whose combined value is unique, and where all properties in the set are present.
This will only appear in Enterprise Edition.
Query
CREATE CONSTRAINT ON (e:Employee) ASSERT (e.firstname, e.surname) IS NODE KEYQuery Plan
Compiler CYPHER 3.5
Planner PROCEDURE
Runtime PROCEDURE
Runtime version 3.5
+--------------------------+
| Operator |
+--------------------------+
| +CreateNodeKeyConstraint |
+--------------------------+
Total database accesses: ?Drop Node Key Constraint
The DropNodeKeyConstraint operator removes a Node Key from a set of properties for all nodes having a certain label.
This will only appear in Enterprise Edition.
Query
DROP CONSTRAINT ON (e:Employee) ASSERT (e.firstname, e.surname) IS NODE KEYQuery Plan
Compiler CYPHER 3.5
Planner PROCEDURE
Runtime PROCEDURE
Runtime version 3.5
+------------------------+
| Operator |
+------------------------+
| +DropNodeKeyConstraint |
+------------------------+
Total database accesses: ?Create Relationship Property Existence Constraint
The CreateRelationshipPropertyExistenceConstraint operator creates an existence constraint on a property for all relationships of a certain type.
This will only appear in Enterprise Edition.
Query
CREATE CONSTRAINT ON ()-[l:LIKED]-() ASSERT exists(l.when)Query Plan
Compiler CYPHER 3.5
Planner PROCEDURE
Runtime PROCEDURE
Runtime version 3.5
+------------------------------------------------+
| Operator |
+------------------------------------------------+
| +CreateRelationshipPropertyExistenceConstraint |
+------------------------------------------------+
Total database accesses: ?Drop Relationship Property Existence Constraint
The DropRelationshipPropertyExistenceConstraint operator removes an existence constraint from a property for all relationships of a certain type.
This will only appear in Enterprise Edition.
Query
DROP CONSTRAINT ON ()-[l:LIKED]-() ASSERT exists(l.when)Query Plan
Compiler CYPHER 3.5
Planner PROCEDURE
Runtime PROCEDURE
Runtime version 3.5
+----------------------------------------------+
| Operator |
+----------------------------------------------+
| +DropRelationshipPropertyExistenceConstraint |
+----------------------------------------------+
Total database accesses: ?Create Index
The CreateIndex operator creates an index on a property for all nodes having a certain label.
The following query will create an index on the name property of nodes with the Country label.
Query
CREATE INDEX ON :Country(name)Query Plan
Compiler CYPHER 3.5
Planner PROCEDURE
Runtime PROCEDURE
Runtime version 3.5
+--------------+
| Operator |
+--------------+
| +CreateIndex |
+--------------+
Total database accesses: ?Drop Index
The DropIndex operator removes an index from a property for all nodes having a certain label.
The following query will drop an index on the name property of nodes with the Country label.
Query
DROP INDEX ON :Country(name)Query Plan
Compiler CYPHER 3.5
Planner PROCEDURE
Runtime PROCEDURE
Runtime version 3.5
+------------+
| Operator |
+------------+
| +DropIndex |
+------------+
Total database accesses: ?