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

      SKIP

      Overview

      The SKIP statement allows you to discard a specified number of records from the start of the working table. A non-negative integer must be specified in SKIP.

      OFFSET can be used as a synonym to SKIP.

      <skip statement> ::= "SKIP" <non-negative integer>
      

      Example Graph

      CREATE GRAPH myGraph { 
        NODE Paper ({title string, score uint32, author string}),
        EDGE Cites ()-[{}]->()
      } PARTITION BY HASH(Crc32) SHARDS [1]
      

      INSERT (p1:Paper {_id:'P1', title:'Efficient Graph Search', score:6, author:'Alex'}),
             (p2:Paper {_id:'P2', title:'Optimizing Queries', score:9, author:'Alex'}),
             (p3:Paper {_id:'P3', title:'Path Patterns', score:7, author:'Zack'}),
             (p1)-[:Cites]->(p2),
             (p2)-[:Cites]->(p3)
      

      Skipping N Records

      MATCH (n:Paper)
      RETURN n.title SKIP 1
      

      Result:

      n.title
      Efficient Graph Search
      Path Patterns

      Skipping N Ordered Records

      MATCH (n:Paper)
      ORDER BY n.score 
      SKIP 1
      MATCH p = (n)->()
      RETURN p
      

      Result: p

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