Change Password

Please enter the password.
Please enter the password. Between 8-64 characters. Not identical to your email address. Contain at least 3 of: uppercase, lowercase, numbers, and special characters.
Please enter the password.
Submit

Change Nickname

Current Nickname:
Submit

Apply New License

License Detail

Please complete this required field.

  • Ultipa Blaze (v4)
  • Ultipa Powerhouse (v5)

Standalone

learn more about the four main severs in the architecture of Ultipa Powerhouse (v5) , click

here

Please complete this required field.

Please complete this required field.

Please complete this required field.

Please complete this required field.

Leave it blank if an HDC service is not required.

Please complete this required field.

Leave it blank if an HDC service is not required.

Please complete this required field.

Please complete this required field.

Mac addresses of all servers, separated by line break or comma.

Please complete this required field.

Please complete this required field.

Cancel
Apply
ID
Product
Status
Cores
Maximum Shard Services
Maximum Total Cores for Shard Service
Maximum HDC Services
Maximum Total Cores for HDC Service
Applied Validity Period(days)
Effective Date
Expired Date
Mac Address
Reason for Application
Review Comment
Close
Profile
  • Full Name:
  • Phone:
  • Company:
  • Company Email:
Change Password
Apply

You have no license application record.

Apply
Certificate Issued at Valid until Serial No. File
Serial No. Valid until File

Not having one? Apply now! >>>

Product Created On ID Amount (USD) Invoice
Product Created On ID Amount (USD) Invoice

No Invoice

v5.3
Search
    English
    v5.3

      UPSERT

      Overview

      The UPSERT statement allows you to update existing nodes and edges in the graph. If no existing data is found, it will insert new nodes or edges instead.

      In typed graphs, each node or edge belongs to exactly one schema, and the assigned schema cannot be changed after insertion. Attempting to update a node or edge with a different schema will result in an error. When a node or edge is updated, the properties specified in the new definition will be updated, while any properties not included remain unchanged.

      On the other hand, when a node or edge is overwritten in open graphs, both its label and property are updated to the new definition.

      Updating Nodes

      An existing node will be updated if _id is included in the property specification and its value can be found in the graph. For example:

      UPSERT (:User {_id: "U2", name: "Jumpy88"})
      

      If a node with _id equal to U2 already exists in the graph, its schema/label and properties will be updated with the new values. If no such node exists, a new node will be inserted.

      UPSERT (:User {name: "Jumpy88"})
      

      Since the property specification does not include _id, a new node will be inserted into the graph.

      Updating Edges

      An existing edge is updated if the EDGE KEY property is included in the property specification and its value can be found in the graph. In addition, the specified source and destination nodes must remain the same.

      For example, the EDGE KEY constraint applies to the property eID:

      ALTER EDGE * ADD CONSTRAINT EDGE KEY ON eID STRING
      

      Learn more about the EDGE KEY constraint →

      MATCH (n1:User {name: "mochaeach"}), (n2:User {name: "Brainy"})
      UPSERT (n1)-[e:Follows {eID: "e6561"}]->(n2)
      

      If an edge with eID equal to e6561 already exists in the graph and its source and destination nodes are mochaeach and Brainy respectively, its schema/label and properties will be updated with the new values. If no such edge exists, a new edge will be inserted.

      Please complete the following information to download this book
      *
      公司名称不能为空
      *
      公司邮箱必须填写
      *
      你的名字必须填写
      *
      你的电话必须填写
      Privacy Policy
      Please agree to continue.

      Copyright © 2019-2025 Ultipa Inc. – All Rights Reserved   |  Security   |  Legal Notices   |  Web Use Notices