7 Running Graph Algorithm Functions in SQL Graph Queries
Oracle Graph provides graph algorithm functions (GAFs) through the
DBMS_OGA PL/SQL package, enabling execution of graph
algorithms such as PageRank (and variants), Bellman-Ford, and Weakly Connected
Components directly within a SQL graph query.
See DBMS_OGA in Oracle AI Database PL/SQL Packages and Types Reference for more information on the package.
Using GAFs, you can analyze the structure of a SQL property graph, and combine the results with graph pattern matching in SQL graph queries.
Learn more about GAFs in the following topics:
- Overview of a Graph Algorithm Function
Graph algorithm functions (GAFs) are Oracle-supplied PL/SQL functions in theDBMS_OGApackage, which is available in the database. - Privileges to Run a Graph Algorithm Function
Review the privileges to execute a graph algorithm function (GAF). - Graph Algorithm Functions Supported by DBMS_OGA
This section describes the graph algorithm functions supported by theDBMS_OGApackage. - Interpreting EXPLAIN PLAN and Parallelism for Graph Algorithm Functions
A graph algorithm function (GAF) execution appears inEXPLAIN PLANas a dedicated operation node namedGRAPH ALGORITHM.
Parent topic: SQL Property Graphs