| CPC G06F 16/24553 (2019.01) [G06F 16/9024 (2019.01)] | 18 Claims |

|
1. A system, comprising:
at least one data processor; and
at least one memory storing instructions which, when executed by the at least one data processor, result in operations comprising:
creating, based at least on a definition, a table user-defined function in a graph query language;
compiling the definition of the table user-defined function, wherein the compiling of the definition of the table user-defined function includes verifying a first table type of a table output by the table user-defined function, wherein the compiling of the definition of the table user-defined function includes verifying an existence and validity of one or more graph workspaces referenced in the definition of the table user-defined function and/or verifying that each execution path within the definition returns a same table type;
receiving a query including a relational query language statement invoking the table user-defined function; and
executing, on at least a portion of a graph data stored in a database, the query including by executing the table user-defined function included in the relational query language statement.
|