Messi Nguélé, Thomas, and Tchuente, Maurice and Méhaut, Jean-François - Social network ordering based on communities to reduce cache misses

arima:1448 - Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, May 10, 2017, Volume 24 - 2017 - Special issue CRI 2015
Social network ordering based on communities to reduce cache misses

Authors: Messi Nguélé, Thomas, and Tchuente, Maurice and Méhaut, Jean-François

ABSTRACT. One of social graph's properties is the community structure, that is, subsets where nodes belonging to the same subset have a higher link density between themselves and a low link density with nodes belonging to external subsets. Futhermore, most social network mining algorithms comprise a local exploration of the underlying graph, which consists in referencing nodes in the neighborhood of a particular node. The idea of this paper is to use the community structure during the storage of large graphs that arise in social network mining. The goal is to reduce cache misses and consequently, execution time. After formalizing the problem of social network ordering as a problem of optimal linear arrangement which is known as NP-Complet, we propose NumBaCo, a heuristic based on the community structure. We present for Katz score and Pagerank, simulations that compare classic data structures Bloc and Yale to their corresponding versions that use NumBaCo. Results on a 32 cores NUMA machine using amazon, dblp and web-google datasets show that NumBaCo allows to reduce from 62% to 80% of cache misses and from 15% to 50% of execution time.


Source : oai:HAL:hal-01304968v5
Volume: Volume 24 - 2017 - Special issue CRI 2015
Published on: May 10, 2017
Submitted on: May 10, 2017
Keywords: Social network mining, Community, Cache miss,Fouille de réseaux sociaux, Communauté, Défaut de cache,[INFO] Computer Science [cs]


Share

Consultation statistics

This page has been seen 138 times.
This article's PDF has been downloaded 49 times.