[In preview] Public Preview: Persistent Graph Semantics
Overview of Persistent Graph Semantics in Azure Data Explorer
Azure Data Explorer has introduced a new feature in public preview: Persistent Graph Semantics, also known as Persistent Graphs. This feature allows users to work with durable graph data structures that persist beyond individual queries, enhancing performance and efficiency in complex relationship-based analyses[1][3].
Key Features of Persistent Graphs
- Graph Models: These are stored representations of labeled property graphs (LPGs) that consist of nodes (vertices) and edges (relationships), both of which can have properties. Unlike transient graphs, graph models do not require rebuilding for each query, significantly improving performance[3].
- Metadata Persistence: Graph specifications are stored in database metadata, ensuring durability and reusability[3].
- Materialized Snapshots: These eliminate the need to rebuild graphs for each query, dramatically improving query performance[3].
- Schema Definition: Graph models support optional but recommended defined schemas for nodes and edges, ensuring data consistency[3].
- Integration with KQL: Seamless integration with Kusto Query Language (KQL) semantics allows for optimized graph traversals and complex pattern matching[3].
Recent Updates
As of June 9, 2025, Azure Data Explorer has made Persistent Graphs available in public preview, further enhancing its capabilities for managing and analyzing large-scale, complex graphs[1]. This development is part of Microsoft's efforts to provide robust solutions for organizational and relational data analysis[2].
Additional Features in Kusto Graph Semantics
In addition to Persistent Graphs, Kusto Graph Semantics offers other powerful features for data analysis, including:
- Star Pattern: Allows users to express nonlinear patterns using multiple comma-delimited sequences, useful for describing connections where different sequences share node variable names[5].
- Default Node ID: Simplifies node identification in graph operations[5].
- Graph-Shortest-Path: Enhances efficiency in finding shortest paths within graphs[5].
- Graph-Mark-Components: Improves clarity by marking components in graph structures[5].
ความคิดเห็น
แสดงความคิดเห็น