HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

SINA: A Scalable Iterative Network Aligner

Abstract : Given two graphs, network alignment asks for a potentially partial mapping between the vertices of the two graphs. This arises in many applications where data from different sources need to be integrated. Recent graph aligners use the global structure of input graphs and additional information given for the edges and vertices. We present SINA, an efficient, shared memory parallel implementation of such an aligner. Our experimental evaluations on a 32-core shared memory machine showed that SINA scales well for aligning large real-world graphs: SINA can achieve up to 28.5× speedup, and can reduce the total execution time of a graph alignment problem with 2M vertices and 100M edges from 4.5 hours to under 10 minutes. To the best of our knowledge, SINA is the first parallel aligner that uses global structure and vertex and edge attributes to handle large graphs.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download

Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Sunday, November 11, 2018 - 10:48:32 PM
Last modification on : Monday, May 16, 2022 - 4:46:02 PM
Long-term archiving on: : Tuesday, February 12, 2019 - 12:44:47 PM


Files produced by the author(s)


  • HAL Id : hal-01918744, version 1



Abdurrahman Yaşar, Bora Uçar, Ümit Çatalyürek. SINA: A Scalable Iterative Network Aligner. 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Aug 2018, Barcelona, Spain. ⟨hal-01918744⟩



Record views


Files downloads