Processing highly connected data as graphs becomes increasingly essential in many domains. Prominent examples are social networks, e.g., Facebook and Twitter, as well as information networks like the World Wide Web or biological networks. One crucial similarity of these domain-specific data is their inherent graph structure, which makes them eligible for analytics using graph algorithms. Besides that, the datasets share two more similarities: they are huge in size, making it hard or even impossible to process them on a single machine and they grow over time, which classifies them as temporal graphs. Intending to analyze these large-scale, temporal datasets, we started developing a framework called “Gradoop” (Graph Analytics on Hadoop®) with the following three main objectives:
Our prototype is built on top of the distributed dataflow framework Apache Flink™. The data model has been designed, and the operators have been implemented. A first use case is the BIIIG project for graph analytics in business information networks. In our ongoing work, we will look into different methods of operator tuning depending on the underlying dataflow system.
Dateien | Cover | Beschreibung | Jahr |
---|---|---|---|
![]() |
Petermann, A.
; Junghanns, M.
; Müller, R.
; Rahm, E.
5th International Workshop on Graph Data Management (GDM 2014)
|
2014 / 3 |