Paper Info
Title
Early experiences in using a domain-specific language for large-scale graph analysis
Abstract
Large-scale graph analysis has recently been drawing lots of attention from both industry and academia. Although there are already several frameworks designed for scalable graph analysis, e.g. Giraph [1], all these frameworks adopt non-traditional programming models and APIs. This can significantly lower the productivity of the framework user. This paper discusses the feasibility of using an intuitive Domain-Specific Language (DSL) for graph analysis. Specifically, we use a compiler to translate Green-Marl [5] programs into an equivalent Giraph application, automatically bridging between very different programming models. We observe that the DSL programs are concise and intuitive, and that the compiler generated Giraph implementations exhibit performance on par with that of hand-written ones. However, the DSL compilation cannot but fail if the algorithm is fundamentally not compatible with the target framework. Overall, we believe that the DSL-based approach will provide great productivity benefits once it matures.
Year
DOI
Venue
2013
10.1145/2484425.2484430
GRADES
Keywords
Field
DocType
great productivity benefit,early experience,scalable graph analysis,graph analysis,giraph implementations exhibit performance,dsl compilation,different programming model,dsl program,large-scale graph analysis,equivalent giraph application,framework user,domain-specific language,distributed system,graph partitioning
Domain-specific language,Graph database,Programming language,Programming paradigm,Computer science,Power graph analysis,Compiler,Theoretical computer science,Graph rewriting,Graph partition,Graph (abstract data type)
Conference
Citations 
PageRank 
References 
3
0.41
8
Authors
5
Name
Order
Citations
PageRank
Sungpack Hong186433.20
Jan Van Der Lugt2341.20
Adam Welc338424.01
Raghavan Raman423510.70
Hassan Chafi5111861.11