6.9.1.1 PGQL Features Supported in Property Graph Schema

PGQL is a SQL-like query language for querying property graph data. It is based on the concept of graph pattern matching and allows you to specify, among other things, topology constraints, paths, filters, sorting and aggregation.

The Java API for PGQL defined in the oracle.pg.rdbms.pgql package supports the PGQL specification with a few exceptions. (The PGQL specification can be found here - PGQL Specification).

The following are a few PGQL features which are not supported:

• Shortest path
• ARRAY_AGG aggregation
• Single CHEAPEST path and TOP-K CHEAPEST path using COST functions
• Case-insensitive matching of uppercased references to labels and properties

Note:

See Supported PGQL Features and Limitations for a complete list of supported and unsupported PGQL features for PGQL on RDBMS (PG_SCHEMA option) .

The following explains a few PGQL features that require special consideration.

• Temporal Types
  
• Type Casting
  
• CONTAINS Built-in Function