ECOOP 2015
Sun 5 - Fri 10 July 2015 Prague, Czech Republic
Tue 7 Jul 2015 13:30 - 14:00 at Karlstejn - Session 3

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
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

13:30 - 14:30
Session 3DSLDI at Karlstejn
DSLs for Graph Algorithms and Graph Pattern Matching
Oskar van RestOracle Labs, Sungpack HongOracle Labs, Hassan ChafiOracle Labs
DSLs of Mathematics, Theorems and Translations
Cezar IonescuChalmers University of Technology, Patrik JanssonChalmers University of Technology