Graphing trillions of triangles

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information visualization Ročník 16; číslo 3; s. 157 - 166
Hlavní autor: Burkhardt, Paul
Médium: Journal Article
Jazyk:angličtina
Vydáno: London, England SAGE Publications 01.07.2017
SAGE PUBLICATIONS, INC
Témata:
Algorithms
Arithmetic
Big Data
Counting
Experiments
Exploration
Graphical representations
Graphs
Knowledge discovery
Mathematics
Special Issue: Big Graph Analytics
visual analytics
scalable algorithms
triangle counting
Graph
parallel programming
MapReduce
ISSN:1473-8716, 1473-8724
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1473-8716
1473-8724
DOI:10.1177/1473871616666393