iTri: Index-based triangle listing in massive graphs

Triangle listing is a basic operator when dealing with many graph problems. However, in-memory algorithms do not work well with recently developed massive graphs such as social networks because these graphs cannot be accommodated in the memory. Thus, external memory-based algorithms have been propos...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information sciences Ročník 336; s. 1 - 20
Hlavní autoři: Rasel, Mostofa Kamal, Han, Yongkoo, Kim, Jinseung, Park, Kisung, Tu, Nguyen Anh, Lee, Young-Koo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.04.2016
Témata:
Algorithms
Clocks
CPU parallelism
Graph indexing
Graph mining
Graphs
I/O-efficient algorithm
Mathematical analysis
Social networks
State of the art
Triangle listing
Triangles
Walls
Graph indexing
CPU parallelism
Triangle listing
I/O-efficient algorithm
Graph mining
ISSN:0020-0255, 1872-6291
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í:Triangle listing is a basic operator when dealing with many graph problems. However, in-memory algorithms do not work well with recently developed massive graphs such as social networks because these graphs cannot be accommodated in the memory. Thus, external memory-based algorithms have been proposed recently, but these approaches still require frequent multiple scans of the whole graph on the disk and large volumes of calculations are performed that involve the whole graph during every iteration. In this study, we propose a novel index-based method for listing triangles in massive graphs. First, we present new notions for the vertex range index and potential cone vertex index. Next, we propose an index join-based triangle listing algorithm. Our method accesses the indexed data asynchronously and joins them to list triangles using a multi-threaded parallel processing technique. Based on experiments, we demonstrate that our algorithm outperforms the state-of-the-art solution methods by three to eight times in terms of the wall clock time.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2015.12.006