DSLs for Graph Algorithms and Graph Pattern Matching
While SQL and procedural languages like PL/SQL have proven very successful for relational-data-based applications, the increasing importance of graph-data-based applications is fueling the need for graph processing DSLs. On the one hand is the need for a procedural-like language that allows you to implement graph algorithms, like Dijkstra’s shortest path algorithm and Brandes’ Betweenness Centrality algorithm, while on the other hand is the need for a declarative graph pattern-matching DSL, much like SQL for graphs. We believe that our DSLs Green-Marl and GMQL are tailored for these two types of graph workloads and we aim at making the languages standards in the field of graph processing.
Tue 7 Jul
|13:30 - 14:00|
|14:00 - 14:30|