Techniques for Graph Analytics on Big Data

Graphs enjoy profound importance because of their versatility and expressivity. They can be effectively used to represent social networks, web search engines and genome sequencing. The field of graph pattern matching has been of significant importance and has wide-spread applications. Conceptually,...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings (IEEE International Congress on Big Data) s. 255 - 262
Hlavní autori: Nisar, M. Usman, Fard, Arash, Miller, John A.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.06.2013
Predmet:
Computational modeling
Data handling
Data models
Distributed algorithms
Global Positioning System
graph analytics; big data; graph simulation; parallel and distributed algorithms
Information management
Pattern matching
ISSN:2379-7703
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Graphs enjoy profound importance because of their versatility and expressivity. They can be effectively used to represent social networks, web search engines and genome sequencing. The field of graph pattern matching has been of significant importance and has wide-spread applications. Conceptually, we want to find subgraphs that match a pattern in a given graph. Much work has been done in this field with solutions like Subgraph Isomorphism and Regular Expression matching. With Big Data, scientists are frequently running into massive graphs that have amplified the challenge that this area poses. We study the speedup and communication behavior of three distributed algorithms for inexact graph pattern matching. We also study the impact of different graph partitionings on runtime and network I/O. Our extensive results show that the algorithms exhibit excellent scalable behavior and min-cut partitioning can lead to improved performance under some circumstances, and can drastically reduce the network traffic as well.
ISSN:2379-7703
DOI:10.1109/BigData.Congress.2013.78