Go to:
Logótipo
Você está em: Start > Publications > View > Scalable subgraph counting using MapReduce
Publication

Scalable subgraph counting using MapReduce

Title
Scalable subgraph counting using MapReduce
Type
Article in International Conference Proceedings Book
Year
2017
Authors
Eddin, AN
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Pedro Ribeiro
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Indexing
Other information
Authenticus ID: P-00M-ZA3
Abstract (EN): Networks are powerful in representing a wide variety of systems in many fields of study. Networks are composed of smaller substructures (subgraphs) that characterize them and give important information related to their topology and functionality. Therefore, discovering and counting these subgraph patterns is very important towards mining the features of networks. Algorithmically, subgraph counting in a network is a computationally hard problem and the needed execution time grows exponentially as the size of the subgraph or the network increases. The main goal of this paper is to contribute towards subgraph search, by providing an accessible and scalable parallel methodology for counting subgraphs. For that we present a dynamic iterative MapReduce strategy to parallelize algorithms that induce an unbalanced search tree, and apply it in the subgraph counting realm. At the core of our methods lies the g-trie, a state-of-the-art data structure that was created precisely for this task. Our strategy employs an adaptive time threshold and an efficient work-sharing mechanism to dynamically do load balancing between the workers. We evaluate our implementations using Spark on a large set of representative complex networks from different fields. The results obtained are very promising and we achieved a consistent and almost linear speedup up to 32 cores, with an average efficiency close to 80%. To the best of our knowledge this is the fastest and most scalable method for subgraph counting within the MapReduce programming model.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 7
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Deep-Graph-Sprints: Accelerated Representation Learning in Continuous-Time Dynamic Graphs (2024)
Article in International Scientific Journal
Eddin, AN; Bono, J; Aparício, DO; Ferreira, H; Pedro Ribeiro; Bizarro, P
Anti-Money Laundering Alert Optimization Using Machine Learning with Graphs (2021)
Article in International Scientific Journal
Eddin, AN; Bono, J; Aparício, D; Polido, D; Ascensão, JT; Bizarro, P; Pedro Ribeiro
From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphs (2023)
Article in International Conference Proceedings Book
Eddin, AN; Bono, J; Aparício, D; Ferreira, H; Ascensao, J; Pedro Ribeiro; Bizarro, P
Recommend this page Top
Copyright 1996-2026 © Faculdade de Farmácia da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2026-02-27 at 07:51:43 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book