Microsoft Fabric Graph has added support for additional #GQL features with richer path semantics, traversal controls, and composable query constructs for analyzing complex graph structures. Variable-length and unbounded paths can be combined with modes such as WALK, TRAIL, SIMPLE, ACYCLIC, and DIFFERENT EDGES to control whether vertices or edges may be revisited during traversal. ANY SHORTEST provides shortest-path matching, while functions such as NODES, EDGES, INNER_NODES, SOURCE, DESTINATION, and ELEMENT_ID expose individual components and identifiers of matched paths. Query composition is enhanced through NEXT, EXISTS, CALL, OPTIONAL CALL, and UNION DISTINCT, enabling multi-stage pattern matching, conditional execution, subqueries, and deduplicated result sets. Aggregation is more expressive through filtered and nested aggregate expressions, alongside COLLECT_ONE, COLLECT_LIST, and COLLECT_ELEMENTS for constructing scalar and collection-based results from graph matches. The language also supports dynamic nested values and explicit type conversion with CAST, together with functions such as RANGE and POWER for generating sequences and performing numerical operations within queries.
https://learn.microsoft.com/en-us/fabric/graph/gql-language-guide
GQL Language Guide for graph in Microsoft Fabric - Microsoft Fabric
Learn how to write GQL queries for graph in Microsoft Fabric, including pattern matching, filtering, aggregation, sorting, and subqueries with examples.
