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 Graph V4

Standalone

Please complete this required field.

Please complete this required field.

The MAC address of the server you want to deploy.

Please complete this required field.

Please complete this required field.

Cancel
Apply
ID
Product
Status
Cores
Applied Validity Period(days)
Effective Date
Excpired Date
Mac Address
Apply Comment
Review Comment
Close
Profile
  • Full Name:
  • Phone:
  • Company:
  • Company Email:
  • Country:
  • Language:
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.0
Search
    English
    v5.0

      WITH

      WITH performs functional operations on the alias and pass the result onto later statements. Heterologous aliases will be Cartesian multiplied.

      Syntax: WITH <expression> as <alias>, <expression> as <alias>, ...
      Input:

      • <expression>: Operational expression
      • <alias>: Alias of operational result, optional

      Deduplicating an alias in WITH will affect its homologous aliases.

      For instance, the deduplication against n2.color affects its homologous alias pnodes(path); the Cartesian multiplication against heterologous aliases n1 and list also affects color, the homologous alias of list:

      find().nodes() as n1 limit 2
      n(3).e()[2].n(as n2) as path
      with pnodes(path) as list, dedup(n2.color) as color
      with n1, list
      return n1, list, color
      

      Sample graph: (to be used for the following examples)

      Run below UQLs one by one in an empty graphset to create graph data:

      create().node_schema("account").node_schema("movie").edge_schema("rate").edge_schema("wishlist")
      create().node_property(@*, "name").node_property(@account, "age", int32).node_property(@movie, "year", int32).edge_property(@rate, "score", int32)
      insert().into(@account).nodes([{_id:"S001", _uuid:1, name:"Pepe", age:24}, {_id:"S002", _uuid:2, name:"Lina", age:23}, {_id:"S003", _uuid:3, name:"Emma", age:26}])
      insert().into(@movie).nodes([{_id:"M001", _uuid:4, name:"Léon", year:1994}, {_id:"M002", _uuid:5, name:"Avatar", year:2009}])
      insert().into(@rate).edges([{_uuid:1, _from_uuid:1, _to_uuid:4, score:9}, {_uuid:2, _from_uuid:3, _to_uuid:5, score:8}])
      insert().into(@wishlist).edges([{_uuid:3, _from_uuid:2, _to_uuid:4}, {_uuid:4, _from_uuid:3, _to_uuid:4}])
      

      Functional Operation

      Example: Find all the nodes of @account that are youngest, return their name

      find().nodes({@account}) as a
      with min(a.age) as minAge
      find().nodes({@account.age == minAge}) as b
      return b.name
      

      Lina
      

      Analysis: The method of sorting all accounts into ascending age and return only one result might miss some results that are also the youngest.

      Cartesian Product

      Example: Pair nodes of @account and @movie, find 1-step paths @account-@movie, return null for those pairs that do not have any path

      find().nodes({@account}) as a
      find().nodes({@movie}) as b
      with a, b
      optional n(a).e().n(b) as p
      return p{*}
      

      Pepe --@rate--> Léon
      null --null-- null
      Lina --@wishlist--> Léon
      null --null-- null
      Emma --@wishlist--> Léon
      Emma --@rate--> Avatar
      
      Please complete the following information to download this book
      *
      公司名称不能为空
      *
      公司邮箱必须填写
      *
      你的名字必须填写
      *
      你的电话必须填写