{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:20:19Z","timestamp":1772911219631,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:00:00Z","timestamp":1628035200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:00:00Z","timestamp":1628035200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000105","name":"Office of Advanced Cyberinfrastructure","doi-asserted-by":"publisher","award":["1755464"],"award-info":[{"award-number":["1755464"]}],"id":[{"id":"10.13039\/100000105","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s00778-021-00688-z","type":"journal-article","created":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T22:02:36Z","timestamp":1628114556000},"page":"287-320","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["G-thinker: a general distributed framework for finding qualified subgraphs in a big graph with load balancing"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4653-0408","authenticated-orcid":false,"given":"Da","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guimu","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jalal","family":"Khalil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Shinn","family":"Ku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C. S.","family":"Lui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,4]]},"reference":[{"key":"688_CR1","unstructured":"Arabesque Code. https:\/\/github.com\/qcri\/Arabesque"},{"key":"688_CR2","unstructured":"COST in the Land of Databases. https:\/\/github.com\/frankmcsherry\/blog\/blob\/master\/posts\/2017-09-23.md"},{"key":"688_CR3","unstructured":"G-Miner Code. https:\/\/github.com\/yaobaiwei\/GMiner"},{"key":"688_CR4","unstructured":"RStream Code. https:\/\/github.com\/rstream-system"},{"issue":"2","key":"688_CR5","first-page":"161","volume":"8","author":"Y Bu","year":"2014","unstructured":"Bu, Y., Borkar, V.R., Jia, J., Carey, M.J., Condie, T.: Pregelix: Big(ger) graph analytics on a dataflow engine. PVLDB 8(2), 161\u2013172 (2014)","journal-title":"PVLDB"},{"key":"688_CR6","doi-asserted-by":"crossref","unstructured":"Chen, H., Liu, M., Zhao, Y., Yan, X., Yan, D., Cheng, J.: G-miner: an efficient task-oriented graph mining system. In EuroSys, pages 32:1\u201332:12 (2018)","DOI":"10.1145\/3190508.3190545"},{"key":"688_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, J., Liu, Q., Li, Z., Fan, W., Lui, J.\u00a0C.\u00a0S., He, C.: VENUS: vertex-centric streamlined graph computation on a single PC. In ICDE, pages 1131\u20131142 (2015)","DOI":"10.1109\/ICDE.2015.7113362"},{"issue":"12","key":"688_CR8","first-page":"1804","volume":"8","author":"A Ching","year":"2015","unstructured":"Ching, A., Edunov, S., Kabiljo, M., Logothetis, D., Muthukrishnan, S.: One trillion edges: Graph processing at facebook-scale. PVLDB 8(12), 1804\u20131815 (2015)","journal-title":"PVLDB"},{"key":"688_CR9","doi-asserted-by":"crossref","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks. TKDD, 6(4):17:1\u201317:32 (2012)","DOI":"10.1145\/2382577.2382581"},{"key":"688_CR10","doi-asserted-by":"crossref","unstructured":"Csun, S., Luo, Q.: Parallelizing recursive backtracking based subgraph matching on a single machine. In ICPADS, pages 42\u201350. IEEE (2018)","DOI":"10.1109\/PADSW.2018.8644869"},{"key":"688_CR11","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137\u2013150 (2004)"},{"key":"688_CR12","doi-asserted-by":"crossref","unstructured":"Dominguez-Sal, D., Urb\u00f3n-Bayes, P., Gim\u00e9nez-Va\u00f1\u00f3, A., G\u00f3mez-Villamor, S., Mart\u00ednez-Bazan, N., Larriba-Pey, J.\u00a0L.: Survey of graph database performance on the HPC scalable graph analysis benchmark. In WAIM Workshops, volume 6185 of Lecture Notes in Computer Science, pages 37\u201348. Springer (2010)","DOI":"10.1007\/978-3-642-16720-1_4"},{"key":"688_CR13","unstructured":"Friendster. http:\/\/snap.stanford.edu\/data\/com-friendster.html"},{"key":"688_CR14","doi-asserted-by":"crossref","unstructured":"Gao, J., Zhou, C., Zhou, J., Yu, J.\u00a0X.: Continuous pattern detection over billion-edge graph using distributed framework. In I.\u00a0F. Cruz, E.\u00a0Ferrari, Y.\u00a0Tao, E.\u00a0Bertino, and G.\u00a0Trajcevski, editors, ICDE, pages 556\u2013567. IEEE Computer Society (2014)","DOI":"10.1109\/ICDE.2014.6816681"},{"key":"688_CR15","doi-asserted-by":"crossref","unstructured":"Guo, G., Yan, D., \u00d6zsu, M.\u00a0T., Jiang, Z., Khalil, J.: Scalable mining of maximal quasi-cliques: An algorithm-system codesign approach. PVLDB (2021)","DOI":"10.14778\/3436905.3436916"},{"key":"688_CR16","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.: I\/o-efficient algorithms on triangle listing and counting. ACM Trans. Database Syst., 39(4):27:1\u201327:30 (2014)","DOI":"10.1145\/2691190.2691193"},{"key":"688_CR17","doi-asserted-by":"crossref","unstructured":"Joshi, A., Zhang, Y., Bogdanov, P., Hwang, J.: An efficient system for subgraph discovery. In IEEE Big Data, pages 703\u2013712 (2018)","DOI":"10.1109\/BigData.2018.8622126"},{"key":"688_CR18","unstructured":"Kyrola, A., Blelloch, G.\u00a0E., Guestrin, C.: Graphchi: Large-scale graph computation on just a PC. In OSDI, pages 31\u201346 (2012)"},{"issue":"2","key":"688_CR19","first-page":"133","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee, J., Han, W., Kasperovics, R., Lee, J.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB 6(2), 133\u2013144 (2012)","journal-title":"PVLDB"},{"key":"688_CR20","doi-asserted-by":"crossref","unstructured":"Lin, W., Xiao, X., Ghinita, G.: Large-scale frequent subgraph mining in mapreduce. In ICDE, pages 844\u2013855 (2014)","DOI":"10.1109\/ICDE.2014.6816705"},{"key":"688_CR21","doi-asserted-by":"crossref","unstructured":"Liu, G., Wong, L.: Effective pruning techniques for mining quasi-cliques. In PKDD, pages 33\u201349 (2008)","DOI":"10.1007\/978-3-540-87481-2_3"},{"key":"688_CR22","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.\u00a0H., Bik, A.\u00a0J.\u00a0C., Dehnert, J.\u00a0C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In SIGMOD Conference, pages 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"688_CR23","doi-asserted-by":"crossref","unstructured":"McCune, R.\u00a0R., Weninger, T., Madey, G.: Thinking like a vertex: A survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput. Surv., 48(2):25:1\u201325:39 (2015)","DOI":"10.1145\/2818185"},{"key":"688_CR24","unstructured":"McSherry, F., Isard, M., Murray, D.\u00a0G.: Scalability! but at what cost? In HotOS (2015)"},{"issue":"11","key":"688_CR25","doi-asserted-by":"publisher","first-page":"1692","DOI":"10.14778\/3342263.3342643","volume":"12","author":"A Mhedhbi","year":"2019","unstructured":"Mhedhbi, A., Salihoglu, S.: Optimizing subgraph queries by combining binary and worst-case optimal joins. Proc. VLDB Endow. 12(11), 1692\u20131704 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"688_CR26","doi-asserted-by":"crossref","unstructured":"Michael, M.\u00a0M., Scott, M.\u00a0L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In PODC, pages 267\u2013275 (1996)","DOI":"10.21236\/ADA309412"},{"key":"688_CR27","doi-asserted-by":"crossref","unstructured":"Quamar, A., Deshpande, A., Lin, J.: Nscale: neighborhood-centric large-scale graph analytics in the cloud. The VLDB Journal, pages 1\u201326 (2014)","DOI":"10.14778\/2733004.2733058"},{"key":"688_CR28","doi-asserted-by":"crossref","unstructured":"Quick, L., Wilkinson, P., Hardcastle, D.: Using pregel-like large scale graph processing frameworks for social network analysis. In ASONAM, pages 457\u2013463 (2012)","DOI":"10.1109\/ASONAM.2012.254"},{"key":"688_CR29","doi-asserted-by":"crossref","unstructured":"Reza, T., Ripeanu, M., Tripoul, N., Sanders, G., Pearce, R.: Prunejuice: pruning trillion-edge graphs to a precise pattern-matching solution. In SC, pages 21:1\u201321:17. IEEE \/ ACM (2018)","DOI":"10.1109\/SC.2018.00024"},{"key":"688_CR30","doi-asserted-by":"crossref","unstructured":"Roy, A., Mihailovic, I., Zwaenepoel, W.: X-stream: edge-centric graph processing using streaming partitions. In SOSP, pages 472\u2013488 (2013)","DOI":"10.1145\/2517349.2522740"},{"key":"688_CR31","doi-asserted-by":"crossref","unstructured":"Shao, Y., Cui, B., Chen, L., Ma, L., Yao, J., Xu, N.: Parallel subgraph listing in a large-scale graph. In C.\u00a0E. Dyreson, F.\u00a0Li, and M.\u00a0T. \u00d6zsu, editors, SIGMOD, pages 625\u2013636. ACM (2014)","DOI":"10.1145\/2588555.2588557"},{"key":"688_CR32","unstructured":"Sheroubi, M.: Benchmarking performance for neo4j in a social media application, https:\/\/people.ok.ubc.ca\/rlawrenc\/research\/Students\/MS_20_Thesis.pdf. Computer Science Bachelor of Science Thesis, The University of British Columbia \u2013 Okanagan Campus (2020)"},{"issue":"9","key":"688_CR33","first-page":"788","volume":"5","author":"Z Sun","year":"2012","unstructured":"Sun, Z., Wang, H., Wang, H., Shao, B., Li, J.: Efficient subgraph matching on billion node graphs. PVLDB 5(9), 788\u2013799 (2012)","journal-title":"PVLDB"},{"issue":"5","key":"688_CR34","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1007\/s10618-016-0466-x","volume":"30","author":"N Talukder","year":"2016","unstructured":"Talukder, N., Zaki, M.J.: A distributed approach for graph mining in massive networks. Data Min. Knowl. Discov. 30(5), 1024\u20131052 (2016)","journal-title":"Data Min. Knowl. Discov."},{"key":"688_CR35","doi-asserted-by":"crossref","unstructured":"Teixeira, C.\u00a0H.\u00a0C., Fonseca, A.\u00a0J., Serafini, M., Siganos, G., Zaki, M.\u00a0J., Aboulnaga, A.: Arabesque: a system for distributed graph mining. In SOSP, pages 425\u2013440 (2015)","DOI":"10.1145\/2815400.2815410"},{"issue":"3","key":"688_CR36","first-page":"193","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Balmin, A., Corsten, S.A., Tatikonda, S., McPherson, J.: From \u201cthink like a vertex\u2019\u2019 to \u201cthink like a graph\u2019\u2019. PVLDB 7(3), 193\u2013204 (2013)","journal-title":"PVLDB"},{"key":"688_CR37","doi-asserted-by":"crossref","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In C.\u00a0Calude, M.\u00a0J. Dinneen, and V.\u00a0Vajnovszki, editors, DMTCS, volume 2731 of Lecture Notes in Computer Science, pages 278\u2013289. Springer (2003)","DOI":"10.1007\/3-540-45066-1_22"},{"key":"688_CR38","unstructured":"Wang, K., Zuo, Z., Thorpe, J., Nguyen, T.\u00a0Q., Xu, G.\u00a0H.: Rstream: Marrying relational algebra with streaming for efficient graph mining on A single machine. In OSDI, pages 763\u2013782 (2018)"},{"issue":"1\u20132","key":"688_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1900000056","volume":"7","author":"D Yan","year":"2017","unstructured":"Yan, D., Bu, Y., Tian, Y., Deshpande, A.: Big graph analytics platforms. Foundations and Trends in Databases 7(1\u20132), 1\u2013195 (2017)","journal-title":"Foundations and Trends in Databases"},{"key":"688_CR40","unstructured":"Yan, D., Chen, H., Cheng, J., \u00d6zsu, M.\u00a0T., Zhang, Q., Lui, J.\u00a0C.\u00a0S.: G-thinker: Big graph mining made easier and faster. CoRR, arXiv:1709.03110, (2017)"},{"issue":"14","key":"688_CR41","first-page":"1981","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Blogel: A block-centric framework for distributed computation on real-world graphs. PVLDB 7(14), 1981\u20131992 (2014)","journal-title":"PVLDB"},{"key":"688_CR42","doi-asserted-by":"crossref","unstructured":"Yan, D., Cheng, J., Lu, Y., Ng, W.: Effective techniques for message reduction and load balancing in distributed graph computation. In WWW, pages 1307\u20131317 (2015)","DOI":"10.1145\/2736277.2741096"},{"issue":"7","key":"688_CR43","doi-asserted-by":"publisher","first-page":"564","DOI":"10.14778\/2904483.2904488","volume":"9","author":"D Yan","year":"2016","unstructured":"Yan, D., Cheng, J., \u00d6zsu, M.T., Yang, F., Lu, Y., Lui, J.C.S., Zhang, Q., Ng, W.: A general-purpose query-centric framework for querying big graphs. Proc. VLDB Endow. 9(7), 564\u2013575 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"688_CR44","doi-asserted-by":"crossref","unstructured":"Yan, D., Guo, G., Chowdhury, M.\u00a0M.\u00a0R., \u00d6zsu, M.\u00a0T., Ku, W., Lui, J.\u00a0C.\u00a0S.: G-thinker: A distributed framework for mining subgraphs in a big graph. In ICDE, pages 1369\u20131380. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00122"},{"key":"688_CR45","doi-asserted-by":"crossref","unstructured":"Yan, D., Qu, W., Guo, G., Wang, X.: Prefixfpm: A parallel framework for general-purpose frequent pattern mining. In ICDE, pages 1938\u20131941. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00208"},{"key":"688_CR46","doi-asserted-by":"crossref","unstructured":"Zhang, Q., Yan, D., Cheng, J.: Quegel: A general-purpose system for querying big graphs. In F.\u00a0\u00d6zcan, G.\u00a0Koutrika, and S.\u00a0Madden, editors, SIGMOD, pages 2189\u20132192. ACM (2016)","DOI":"10.1145\/2882903.2899398"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00688-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00688-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00688-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T09:11:22Z","timestamp":1647421882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00688-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,4]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["688"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00688-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,4]]},"assertion":[{"value":"30 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}