Terminologies - UQL - Ultipa Graph

Change Password

Submit

Change Email

Submit

Change Nickname

Current Nickname:

Submit

Profile

Account ID:

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

Create Ultipa Account

Already have an Ultipa account? Sign in now!

Forgot Password

Reset Password

Back to sign in

Terminologies

Name	Description
GQL	Graph Query Language, another and the only standard data query language since SQL (Structured Query Language).
UQL	Ultipa Query Language, a kind of GQL that can fully operate Ultipa Graph system.
Node	Represent an entity in the real world; also known as a 'vertex' in graph theory.
Edge	Represent a relationship between entities in the real world. An edge connects a pair of nodes; all edges in Ultipa Graph are directed. The edge connecting two identical nodes is called a self-loop.
Metadata	The general term for nodes and edges.
Path	A sequence with a definite initial node and terminal node, alternating between nodes and edges. Nodes in path can repeat while edges cannot. The sequence of the nodes and edges in a path can be regarded as the unique identifier of the path.
Intermediate Node	Nodes in a path other than the initial and terminal nodes.
Circle	When a path has repeated node(s), it is viewed as having circle(s). Paths with circle(s) can be ruled out using the parameter `no_circle()` in the path query command so they will not be returned. Please note that the circle in A-to-B path and Autonet query must have intermediate node:
Shortest Path	If a path contains the least number of edges (at least one edge) to walk from its initial node to terminal node, it is called a shortest path of the specified initial node and terminal node. The 'least number of edges' should be understood as 'minimum sum of edge weights' in case of a weighted shortest path.
Graph	The dataset of nodes and edges, which is equivalent to a collection of multiple paths that intersect. The smallest unit of graph is node, a graph is not necessarily connected.
Subgraph	A part of nodes and edges of a graph. The result of node query and path query can be considered as a subgraph.
GraphSet	Include the graph data (nodes and edges), graph model (definition of schemas and properties), property indexes, full-text indexes, engine indexes and algorithmic tasks created on the graph.
Graph System	Ultipa Graph HTAP System, a combination of graph computing engine, graph algorithm engine, full-text search engine and etc., built upon a server cluster. An Ultipa Graph system also contains GraphSets, users and policies, and the algorithm packages installed by the user.
Instance	Ultipa Graph system instances, that is, the running applications on Ultipa Server. Each instance generally runs on one virtual or physical host, and multiple instances can form a cluster environment.
Schema	A schema of node or edge includes a set of properties that describes the structure and content of the node or edge. Each node or edge belongs to one and only one schema.
Property	A property belongs to a schema and is used to describe a characteristic of a node or edge. There are system properties and custom properties.
Graph Model	The definition of schemas and properties of a graph, representing the application scenario a graph describes.
Property Index	An index created for property values and stored in the disk, to improve the property filtering efficiency for metadata queries.
Full-text Index	A reverse index created for the word-segmentation results of property values and stored in the disk, to improve the query efficiency for keywords against long text. Ultipa self-developed full-text engine employs different dictionaries to optimize the word-segmentation for different datasets.
Engine Index	The property index loaded to the computing engine, to improve the efficiency of path query and deep graph traversal by reducing I/O cost. The query efficiency is often increased by several orders of magnitude. Engine index is mandatory when executing inter-step comparison, inter-step filtering, weighted shortest path querying, etc. (Also refer to the term LTE).
Filter	Appear in parameters that represent nodes or edges in the query command, to filter nodes and edges during graph queries. Ultipa filter is essentially a logic tree, which uses conditional operators, logical operators and numeric operators to calculate operands and return True or False.
LTE	Load to Engine; load property to the computing engine to create an engine index.
UFE	Unload from Engine; remove property from the computing engine to delete an engine index.
Direction (In)	An edge pointing to node A from another node is called an "In" edge of node A, or an edge of node A in the inbound direction. It is written as either A<-- or -->A.
Direction (Out)	An edge pointing from node A to another node is called an "Out" edge of node A, or an edge of node A in the outbound direction. It is written as either A--> or <--A.
Direction (Left)	An edge in a given path that points from the latter node to the previous node is called "Left" edge. It is written as A<--B.
Direction (Right)	An edge in a given path that points from the previous node to the latter node is called "Right" edge. It is written as A-->B.
Unique Identifier (UID)	System properties that are used as the unique identifier of metadata, including the `_id` of node that is a string with maximum 128 bytes, and `_uuid` of node and edge that is a uint64.
FROM	System properties that represents the UID of the start node of an edge, including `_from` and `_from_uuid`, i.e., the `_id` and `_uuid` of the start node.
TO	System properties that represents the UID of the end node of an edge, including `_to` and `_to_uuid`, i.e., the `_id` and `_uuid` of the end node.

ID
Product
Status
Cores
Applied Validity Period(days)
Effective Date
Excpired Date
Mac Address
Apply Comment
Review Comment