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)

Standalone

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:
  • 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

v4.5
Search
    English
    v4.5

      Graph Analytics and Algorithms

      Ultipa offers an ever-growing rich set of algorithms for graph analytics purposes, including various algorithms of degree, centrality, community/clustering (such as Louvain, LPA), graph embedding (such as Random Walk, Node2Vec, Line), and graph traversal related (such as K-Hop Whole Graph, etc.).

      Many Ultipa algorithms can compute in a real-time fashion, such as the similarity between two nodes; some whole-graph and whole-data running algorithms can achieve near-real-time effect through asynchronous tasks, such as PageRank, LPA, etc.

      Ultipa algorithm package is offered to users as a hot-pluggable plugin that can be hot-updated. Both advanced algorithm package and custom algorithm package are available to users.

      Category Examples
      Basic algorithm Degree, Centrality, Similarity
      General algorithm K-Hop Whole Graph, Connected Component, Triangle Counting, Common Neighbors, Induced Subgraph, Bipartite Graph
      Advanced algorithm HyperANF, K-NearestNeighbor, k-Core, MST, k-Means, Local Clustering Coefficient
      Label propagation algorithm PageRank, Sybil Rank, Label Propagation, HANP
      Community detection algorithm Louvain Community Recognition
      Graph embedding algorithm Random Walk, Node2Vec, Struc2Vec, LINE, Fast RP, GraphSage
      Algorithm that calculates nodes Degree, Centrality, Similarity, Common Neighbors
      Algorithm that performs calculations on the whole graph Algorithms that are not single node oriented
      Algorithm that can be completed in real time for 10 million nodes/edges and below Louvain Community Recognition
      AI algorithm Random Walk, Node2Vec, Struc2Vec, LINE, Fast RP, GraphSage
      Please complete the following information to download this book
      *
      公司名称不能为空
      *
      公司邮箱必须填写
      *
      你的名字必须填写
      *
      你的电话必须填写