A Survey on Distributed Graph Pattern Matching in Massive Graphs - Archive ouverte HAL Access content directly
Journal Articles ACM Computing Surveys Year : 2021

A Survey on Distributed Graph Pattern Matching in Massive Graphs

Abstract

Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it impractical for graph pattern matching (GPM) in the context of big data. As a result, relaxed GPM models have emerged as they yield interesting results in a polynomial time. However, massive graphs generated by mostly social networks require a distributed storing and processing of the data over multiple machines. Thus, requiring GPM to be revised by adopting new paradigms of big graphs processing, e.g. Think-Like-A-Vertex and its derivatives. This paper discusses and proposes a classification of distributed GPM approaches with a narrow focus on the relaxed models.
Fichier principal
Vignette du fichier
Revised Survey R1 18-10-2020.pdf (1.47 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03141901 , version 1 (26-02-2021)

Licence

Copyright

Identifiers

Cite

Sarra Bouhenni, Said Yahiaoui, Nadia Nouali-Taboudjemat, Hamamache Kheddouci. A Survey on Distributed Graph Pattern Matching in Massive Graphs. ACM Computing Surveys, 2021, 54 (2), pp.36. ⟨10.1145/3439724⟩. ⟨hal-03141901⟩
149 View
501 Download

Altmetric

Share

Gmail Facebook X LinkedIn More