Show simple item record

dc.contributor.authorRen, X
dc.contributor.authorWang, J
dc.contributor.authorHan, WS
dc.contributor.authorYu, JX
dc.date.accessioned2020-04-21T01:24:17Z
dc.date.available2020-04-21T01:24:17Z
dc.date.issued2019
dc.identifier.issn2150-8097
dc.identifier.doi10.14778/3342263.3342272
dc.identifier.urihttp://hdl.handle.net/10072/393300
dc.description.abstractWe study the subgraph enumeration problem under distributed settings. Existing solutions either suffer from severe memory crisis or rely on large indexes, which makes them impractical for very large graphs. Most of them follow a synchronous model where the performance is often bottlenecked by the machine with the worst performance. Motivated by this, in this paper, we propose RADS, a Robust Asynchronous Distributed Subgraph enumeration system. RADS first identifies results that can be found using single-machine algorithms. This strategy not only improves the overall performance but also reduces network communication and memory cost. Moreover, RADS employs a novel region-grouped multi-round expand verify & filter framework which does not need to shuffle and exchange the intermediate results, nor does it need to replicate a large part of the data graph in each machine. This feature not only reduces network communication cost and memory usage, but also allows us to adopt simple strategies for memory control and load balancing, making it more robust. Several optimization strategies are also used in RADS to further improve the performance. Our experiments verified the superiority of RADS to state-of-the-art subgraph enumeration approaches.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherAssociation for Computing Machinery (ACM)
dc.relation.ispartofconferencename45th International Conference on Very Large Data Bases (VLDB 2019)
dc.relation.ispartofconferencetitleProceedings of the VLDB Endowment
dc.relation.ispartofdatefrom2019-08-26
dc.relation.ispartofdateto2019-08-30
dc.relation.ispartoflocationLos Angeles, USA
dc.relation.ispartofpagefrom1344
dc.relation.ispartofpageto1356
dc.relation.ispartofissue11
dc.relation.ispartofvolume12
dc.subject.fieldofresearchDistributed systems and algorithms
dc.subject.fieldofresearchcode460605
dc.titleFast and robust distributed subgraph enumeration
dc.typeConference output
dc.type.descriptionE1 - Conferences
dcterms.bibliographicCitationRen, X; Wang, J; Han, WS; Yu, JX, Fast and robust distributed subgraph enumeration, Proceedings of the VLDB Endowment, 2019, 12 (11), pp. 1344-1356
dcterms.licensehttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.date.updated2020-04-21T01:20:22Z
dc.description.versionVersion of Record (VoR)
gro.rights.copyright© The Author(s) 2019. This is an Open Access article distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivs 4.0 International (CC BY-NC-ND 4.0) License, which permits unrestricted, non-commercial use, distribution and reproduction in any medium, providing that the work is properly cited.
gro.hasfulltextFull Text
gro.griffith.authorWang, John


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record