CREATE UNIQUE is in the middle of MATCH and CREATE — it will match what it can, and create what is missing.
CREATE UNIQUE will always make the least change possible to the graph — if it can use parts of the existing graph,
it will.
Another difference to MATCH is that CREATE UNIQUE assumes the pattern to be unique. If multiple matching subgraphs
are found an exception will be thrown.
| Tip | |
|---|---|
In the |
CREATE UNIQUE is used to describe the pattern that should be found or created.
Query
START left=node(1), right=node(3,4) CREATE UNIQUE left-[r:KNOWS]->right RETURN r
The left node is matched agains the two right nodes. One relationship already exists and can be matched, and the other relationship is created before it is returned.
If the pattern described needs a node, and it can’t be matched, a new node will be created.
Query
START root=node(2) CREATE UNIQUE root-[:LOVES]-someone RETURN someone
The root node doesn’t have any LOVES relationships, and so a node is created, and also a relationship to that node.
The pattern described can also contain values on the node. These are given using the following syntax: prop : <expression>.
Query
START root=node(2)
CREATE UNIQUE root-[:X]-(leaf {name:'D'} )
RETURN leafNo node connected with the root node has the name D, and so a new node is created to match the pattern.
Relationships to be created can also be matched on values.
Query
START root=node(2)
CREATE UNIQUE root-[r:X {since:'forever'}]-()
RETURN rIn this example, we want the relationship to have a value, and since no such relationship can be found, a new node and relationship are created. Note that since we are not interested in the created node, we don’t name it.
Result
| r |
|---|
| 1 row |
| Nodes created: 1 |
| Relationships created: 1 |
| Properties set: 1 |
| 1 ms |
|
The pattern described by CREATE UNIQUE can be separated by commas, just like in MATCH and CREATE.
Query
START root=node(2) CREATE UNIQUE root-[:FOO]->x, root-[:BAR]->x RETURN x
This example pattern uses two paths, separated by a comma.
Copyright © 2012 Neo Technology