Technical Report TR739:
Thejaka Amila Kanewala
Graph DSLs : A Survey on Green-Marl & Sparql
(Jul 2017), 11
[A Report Submitted in Partial Satisfaction of the Requirements for an Independent Research 2014.]
Many real world problems are formulated as graphs and standard graph processing algorithms are used to search solutions. Applications of graphs and related algorithms can be found in many domains. Domains vary from standard scientific applications to social media applications such as Facebook. Creating and processing graphs in HPC environments adds lot of complexities. Hiding detail complexities and yet achieving the necessary performance enables lot of people to develop graph applications. In this paper we discuss about 2 such graph specific programming languages; 1. Green-Marl - an imperative programming language for graph processing, 2. SPARQL - An SQL like query language for graph processing.
- Available as: