{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:17:04Z","timestamp":1775873824474,"version":"3.50.1"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>\n            We 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\n            <jats:italic>region-grouped multi-round expand verify &amp; filter<\/jats:italic>\n            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.\n          <\/jats:p>","DOI":"10.14778\/3342263.3342272","type":"journal-article","created":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T18:36:11Z","timestamp":1568831771000},"page":"1344-1356","source":"Crossref","is-referenced-by-count":30,"title":["Fast and robust distributed subgraph enumeration"],"prefix":"10.14778","volume":"12","author":[{"given":"Xuguang","family":"Ren","sequence":"first","affiliation":[{"name":"Griffith University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junhu","family":"Wang","sequence":"additional","affiliation":[{"name":"Griffith University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wook-Shin","family":"Han","sequence":"additional","affiliation":[{"name":"POSTECH, Public of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544814"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3199517.3199520"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90130-8"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196918"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035942"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.07.011"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1758222.1758229"},{"key":"e_1_2_1_8_1","first-page":"7","volume-title":"PVM\/MPI","author":"Gropp W.","year":"2002","unstructured":"W. Gropp . MPICH2 : A new start for mpi implementations . In PVM\/MPI , pages 7 -- 7 , 2002 . W. Gropp. MPICH2: A new start for mpi implementations. In PVM\/MPI, pages 7--7, 2002."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_2_1_10_1","volume-title":"Metis - unstructured graph partitioning and sparse matrix ordering system, version 2.0. Technical report","author":"Karypis G.","year":"1995","unstructured":"G. Karypis and V. Kumar . Metis - unstructured graph partitioning and sparse matrix ordering system, version 2.0. Technical report , 1995 . G. Karypis and V. Kumar. Metis - unstructured graph partitioning and sparse matrix ordering system, version 2.0. Technical report, 1995."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915209"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794368"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021937"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"e_1_2_1_15_1","volume-title":"PODS, page 6","author":"Malewicz G.","year":"2009","unstructured":"G. Malewicz , M. H. Austern , A. J. C. Bik , J. C. Dehnert , I. Horn , N. Leiser , and G. Czajkowski . Pregel: a system for large-scale graph processing . In PODS, page 6 , 2009 . G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In PODS, page 6, 2009."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149198"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"e_1_2_1_18_1","volume-title":"Fast and robust distributed subgraph enumeration. arXiv preprint arXiv:1901.07747","author":"Ren X.","year":"2019","unstructured":"X. Ren , J. Wang , W.-S. Han , and J. X. Yu . Fast and robust distributed subgraph enumeration. arXiv preprint arXiv:1901.07747 , 2019 . X. Ren, J. Wang, W.-S. Han, and J. X. Yu. Fast and robust distributed subgraph enumeration. arXiv preprint arXiv:1901.07747, 2019."},{"key":"e_1_2_1_19_1","volume-title":"The Boost C++ Libraries","author":"Schling B.","year":"2011","unstructured":"B. Schling . The Boost C++ Libraries . XML Press , 2011 . B. Schling. The Boost C++ Libraries. XML Press, 2011."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588557"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3342263.3342272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:56:33Z","timestamp":1672221393000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3342263.3342272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":20,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["10.14778\/3342263.3342272"],"URL":"https:\/\/doi.org\/10.14778\/3342263.3342272","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}