Frequent Subgraph Mining Based on Pregel | Zendy

Xiang Zhao | Zendy; Yifan Chen | Zendy; Chuan Xiao | Zendy; Yoshiharu Ishikawa | Zendy; Jiuyang Tang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Frequent Subgraph Mining Based on Pregel

Author(s) -

Xiang Zhao,

Yifan Chen,

Chuan Xiao,

Yoshiharu Ishikawa,

Jiuyang Tang

Publication year - 2016

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/bxv118

Subject(s) - computer science , scalability , graph algorithms , graph , theoretical computer science , overhead (engineering) , parallel computing , distributed computing , database , programming language

Graph is an increasingly popular way to model complex data, and the size of single graphs is growing toward massive. Nonetheless, executing graph algorithms efficiently and at scale is surprisingly challenging. As a consequence, distributed programming frameworks have emerged to empower large graph processing. Pregel, as a popular computational model for processing billion-vertex graphs, has been ...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research