{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T17:17:06Z","timestamp":1780766226886,"version":"3.54.1"},"reference-count":100,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T00:00:00Z","timestamp":1717718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T00:00:00Z","timestamp":1717718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00778-024-00856-x","type":"journal-article","created":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T20:07:12Z","timestamp":1717790832000},"page":"1453-1484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallelization of butterfly counting on hierarchical memory"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9204-4075","authenticated-orcid":false,"given":"Zhibin","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Longbin","family":"Lai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yixue","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bing","family":"Shui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sheng","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,7]]},"reference":[{"issue":"4","key":"856_CR1","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/comnet\/cnx001","volume":"5","author":"SG Aksoy","year":"2017","unstructured":"Aksoy, S.G., Kolda, T.G., Pinar, A.: Measuring and modeling bipartite graphs with community structure. J. Complex Netw. 5(4), 581\u2013603 (2017)","journal-title":"J. Complex Netw."},{"key":"856_CR2","doi-asserted-by":"crossref","unstructured":"Allahbakhsh, M., Ignjatovic, A., Benatallah, B., Beheshti, S.M.R., Bertino, E., Foo, N.: Collusion detection in online rating systems. In: Web Technologies and Applications: 15th Asia-Pacific Web Conference, APWeb 2013, Sydney, Australia, April 4\u20136, 2013. Proceedings 15, pp. 196\u2013207. Springer (2013)","DOI":"10.1007\/978-3-642-37401-2_21"},{"key":"856_CR3","doi-asserted-by":"crossref","unstructured":"Ammar, K., McSherry, F., Salihoglu, S., Joglekar, M.: Distributed evaluation of subgraph queries using worstcase optimal lowmemory dataflows (2018). arXiv:1802.03760","DOI":"10.14778\/3184470.3184473"},{"key":"856_CR4","doi-asserted-by":"crossref","unstructured":"Bhattarai, B., Liu, H., Huang, H.H.: Ceci: Compact embedding cluster index for scalable subgraph matching. In: Proceedings of the 2019 International Conference on Management of Data, pp. 1447\u20131462 (2019)","DOI":"10.1145\/3299869.3300086"},{"key":"856_CR5","doi-asserted-by":"crossref","unstructured":"Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1199\u20131214 (2016)","DOI":"10.1145\/2882903.2915236"},{"key":"856_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P., Marino, A., Santini, M., Vigna, S.: BUbiNG: Massive Crawling for the Masses. In: WWW, pp. 227\u2013228 (2014)","DOI":"10.1145\/2567948.2577304"},{"key":"856_CR7","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. In: WWW, pp. 587\u2013596. ACM Press (2011)","DOI":"10.1145\/1963405.1963488"},{"key":"856_CR8","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: The WebGraph Framework I: Compression Techniques. In: WWW, pp. 595\u2013601. ACM Press (2004)","DOI":"10.1145\/988672.988752"},{"key":"856_CR9","unstructured":"cgroup. https:\/\/www.kernel.org\/doc\/Documentation\/cgroup-v2.txt"},{"key":"856_CR10","unstructured":"Chen, H., Li, X., Huang, Z.: Link prediction approach to collaborative filtering. In: Proceedings of the 5th ACM\/IEEE-CS Joint Conference on Digital Libraries (JCDL\u201905), pp. 141\u2013142. IEEE (2005)"},{"key":"856_CR11","unstructured":"Chen, X., et\u00a0al.: Efficient and scalable graph pattern mining on $$\\{$$GPUs$$\\}$$. In: 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22), pp. 857\u2013877 (2022)"},{"issue":"1","key":"856_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985). https:\/\/doi.org\/10.1137\/0214017","journal-title":"SIAM J. Comput."},{"key":"856_CR13","volume-title":"Overview of the trec 2009 web track","author":"CL Clarke","year":"2009","unstructured":"Clarke, C.L., Craswell, N., Soboroff, I.: Overview of the trec 2009 web track. WATERLOO UNIV (ONTARIO), Tech. rep. (2009)"},{"issue":"1","key":"856_CR14","doi-asserted-by":"publisher","first-page":"833","DOI":"10.14778\/1453856.1453947","volume":"1","author":"G Cormode","year":"2008","unstructured":"Cormode, G., Srivastava, D., Yu, T., Zhang, Q.: Anonymizing bipartite graph data using safe groupings. Proc. VLDB Endow. 1(1), 833\u2013844 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"856_CR15","unstructured":"Cuda toolkit. https:\/\/developer.nvidia.com\/cuda-toolkit"},{"key":"856_CR16","doi-asserted-by":"publisher","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201901, pp. 269\u2013274. Association for Computing Machinery, New York, NY, USA (2001). https:\/\/doi.org\/10.1145\/502512.502550","DOI":"10.1145\/502512.502550"},{"key":"856_CR17","unstructured":"DIMACS: Dimacs challenge. http:\/\/dimacs.rutgers.edu\/Challenges\/"},{"key":"856_CR18","doi-asserted-by":"crossref","unstructured":"Finnerty, E., Sherer, Z., Liu, H., Luo, Y.: Dr. bfs: Data centric breadth-first search on fpgas. In: 2019 56th ACM\/IEEE Design Automation Conference (DAC), pp. 1\u20136 (2019)","DOI":"10.1145\/3316781.3317802"},{"key":"856_CR19","unstructured":"Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: Proceedings of the 31st International Conference on Very Large Data Bases, VLDB \u201905, pp. 721\u2013732. VLDB Endowment (2005)"},{"key":"856_CR20","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: $$\\{$$PowerGraph$$\\}$$: Distributed $$\\{$$Graph-Parallel$$\\}$$ computation on natural graphs. In: 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12), pp. 17\u201330 (2012)"},{"key":"856_CR21","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 405\u2013418 (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"856_CR22","doi-asserted-by":"crossref","unstructured":"Hoang, L., Jatala, V., Chen, X., Agarwal, U., Dathathri, R., Gill, G., Pingali, K.: Disttc: High performance distributed triangle counting. In: 2019 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20137. IEEE (2019)","DOI":"10.1109\/HPEC.2019.8916438"},{"issue":"8","key":"856_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/2038037.1941590","volume":"46","author":"S Hong","year":"2011","unstructured":"Hong, S., Kim, S.K., Oguntebi, T., Olukotun, K.: Accelerating CUDA graph algorithms at maximum warp. Acm Sigplan Notices 46(8), 267\u2013276 (2011)","journal-title":"Acm Sigplan Notices"},{"key":"856_CR24","doi-asserted-by":"publisher","unstructured":"Hong, S., Oguntebi, T., Olukotun, K.: Efficient parallel graph exploration on multi-core cpu and gpu. In: 2011 International Conference on Parallel Architectures and Compilation Techniques, pp. 78\u201388 (2011). https:\/\/doi.org\/10.1109\/PACT.2011.14","DOI":"10.1109\/PACT.2011.14"},{"key":"856_CR25","doi-asserted-by":"crossref","unstructured":"Hu, L., Zou, L.: A gpu-based graph pattern mining system. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pp. 4867\u20134871 (2022)","DOI":"10.1145\/3511808.3557192"},{"key":"856_CR26","doi-asserted-by":"publisher","unstructured":"Hu, X., Chiueh, T.c., Shin, K.G.: Large-scale malware indexing using function-call graphs. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, CCS \u201909, p. 611\u2013620. Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1653662.1653736","DOI":"10.1145\/1653662.1653736"},{"key":"856_CR27","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.W.: Massive graph triangulation. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 325\u2013336 (2013)","DOI":"10.1145\/2463676.2463704"},{"issue":"4","key":"856_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2691190.2691193","volume":"39","author":"X Hu","year":"2014","unstructured":"Hu, X., Tao, Y., Chung, C.W.: I\/o-efficient algorithms on triangle listing and counting. ACM Trans. Database Syst. (TODS) 39(4), 1\u201330 (2014)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"856_CR29","doi-asserted-by":"crossref","unstructured":"Hu, Y., Liu, H., Huang, H.H.: Tricore: Parallel Triangle Counting on GPUs. In: SC, pp. 171\u2013182. IEEE (2018)","DOI":"10.1109\/SC.2018.00017"},{"key":"856_CR30","doi-asserted-by":"crossref","unstructured":"Huang, S., El-Hadedy, M., Hao, C., Li, Q., Mailthody, V.S., Date, K., Xiong, J., Chen, D., Nagi, R., Hwu, W.m.: Triangle Counting and Truss Decomposition using FPGA. In: HPEC, pp. 1\u20137. IEEE (2018)","DOI":"10.1109\/HPEC.2018.8547536"},{"issue":"4","key":"856_CR31","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/99935.99944","volume":"15","author":"HV Jagadish","year":"1990","unstructured":"Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Syst. 15(4), 558\u2013598 (1990). https:\/\/doi.org\/10.1145\/99935.99944","journal-title":"ACM Trans. Database Syst."},{"key":"856_CR32","doi-asserted-by":"publisher","unstructured":"Khorasani, F., Vora, K., Gupta, R., Bhuyan, L.N.: Cusha: Vertex-centric graph processing on gpus. In: Proceedings of the 23rd International Symposium on High-Performance Parallel and Distributed Computing, HPDC \u201914, pp. 239\u2013252. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2600212.2600227","DOI":"10.1145\/2600212.2600227"},{"key":"856_CR33","doi-asserted-by":"crossref","unstructured":"Kunegis, J.: Konect: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343\u20131350 (2013)","DOI":"10.1145\/2487788.2488173"},{"key":"856_CR34","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a Social Network or a News Media? In: WWW, pp. 591\u2013600 (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"856_CR35","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: $$\\{$$GraphChi$$\\}$$:$$\\{$$Large-Scale$$\\}$$ graph computation on just a $$\\{$$PC$$\\}$$. In: 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12), pp. 31\u201346 (2012)"},{"issue":"10","key":"856_CR36","doi-asserted-by":"publisher","first-page":"974","DOI":"10.14778\/2794367.2794368","volume":"8","author":"L Lai","year":"2015","unstructured":"Lai, L., Qin, L., Lin, X., Chang, L.: Scalable subgraph enumeration in mapreduce. Proc. VLDB Endow. 8(10), 974\u2013985 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"10","key":"856_CR37","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.14778\/3339490.3339494","volume":"12","author":"L Lai","year":"2019","unstructured":"Lai, L., Qing, Z., Yang, Z., Jin, X., Lai, Z., Wang, R., Hao, K., Lin, X., Qin, L., Zhang, W., et al.: Distributed subgraph matching on timely dataflow. Proc. VLDB Endow. 12(10), 1099\u20131112 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"856_CR38","unstructured":"Lai, L., Yang, Y., Wang, Z., Liu, Y., Ma, H., Shen, S., Lyu, B., Zhou, X., Yu, W., Qian, Z., et\u00a0al.: $$\\{$$GLogS$$\\}$$: Interactive graph pattern matching query at large scale. In: 2023 USENIX Annual Technical Conference (USENIX ATC 23), pp. 53\u201369 (2023)"},{"key":"856_CR39","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: an approach to modeling networks. J. Mach. Learn. Res. 11(2) (2010)"},{"key":"856_CR40","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3138103","author":"H Li","year":"2021","unstructured":"Li, H., Kong, F., Yu, J.: Secure outsourcing for normalized cuts of large-scale dense graph in internet of things. IEEE Internet Things J. (2021). https:\/\/doi.org\/10.1109\/JIOT.2021.3138103","journal-title":"IEEE Internet Things J."},{"issue":"5","key":"856_CR41","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.056127","volume":"72","author":"PG Lind","year":"2005","unstructured":"Lind, P.G., Gonzalez, M.C., Herrmann, H.J.: Cycles and clustering in bipartite networks. Phys. Rev. E 72(5), 056127 (2005)","journal-title":"Phys. Rev. E"},{"key":"856_CR42","doi-asserted-by":"publisher","unstructured":"Liu, C., Shao, Z., Li, K., Wu, M., Chen, J., Li, R., Liao, X., Jin, H.: Scalabfs: A scalable bfs accelerator on fpga-hbm platform. In: The 2021 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, FPGA \u201921, p. 147. Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3431920.3439463","DOI":"10.1145\/3431920.3439463"},{"key":"856_CR43","doi-asserted-by":"crossref","unstructured":"Liu, H., Huang, H.H.: Enterprise: breadth-first graph traversal on gpus. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201312 (2015)","DOI":"10.1145\/2807591.2807594"},{"key":"856_CR44","unstructured":"Liu, H., Huang, H.H.: $$\\{$$SIMD-X$$\\}$$: Programming and processing of graph algorithms on $$\\{$$GPUs$$\\}$$. In: 2019 USENIX Annual Technical Conference (USENIX ATC 19), pp. 411\u2013428 (2019)"},{"key":"856_CR45","doi-asserted-by":"crossref","unstructured":"Liu, J., Wang, W.: Op-cluster: Clustering by tendency in high dimensional space. In: Third IEEE International Conference on Data Mining, pp. 187\u2013194. IEEE (2003)","DOI":"10.1109\/ICDM.2003.1250919"},{"key":"856_CR46","doi-asserted-by":"crossref","unstructured":"Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., Zhou, J.: Maximum biclique search at billion scale. Proc. VLDB Endow. (2020)","DOI":"10.14778\/3397230.3397234"},{"key":"856_CR47","unstructured":"Ma, L., Yang, Z., Miao, Y., Xue, J., Wu, M., Zhou, L., Dai, Y.: Neugraph: Parallel deep neural network computation on large graphs. In: 2019 USENIX Annual Technical Conference (USENIX ATC 19), pp. 443\u2013458. USENIX Association, Renton, WA (2019). https:\/\/www.usenix.org\/conference\/atc19\/presentation\/ma"},{"key":"856_CR48","doi-asserted-by":"publisher","unstructured":"Mai, S.T., Dieu, M.S., Assent, I., Jacobsen, J., Kristensen, J., Birk, M.: Scalable and interactive graph clustering algorithm on multicore cpus. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 349\u2013360 (2017). https:\/\/doi.org\/10.1109\/ICDE.2017.94","DOI":"10.1109\/ICDE.2017.94"},{"key":"856_CR49","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"issue":"1","key":"856_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-018-2483-9","volume":"20","author":"I Melckenbeeck","year":"2019","unstructured":"Melckenbeeck, I., Audenaert, P., Van Parys, T., Van De Peer, Y., Colle, D., Pickavet, M.: Optimising orbit counting of arbitrary order by equation selection. BMC Bioinform. 20(1), 1\u201313 (2019)","journal-title":"BMC Bioinform."},{"key":"856_CR51","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 29\u201342 (2007)","DOI":"10.1145\/1298306.1298311"},{"key":"856_CR52","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., et\u00a0al.: Data streams: Algorithms and applications. Found. Trends\u00ae Theor. Comput. Sci. 1(2), 117\u2013236 (2005)","DOI":"10.1561\/0400000002"},{"issue":"3","key":"856_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3180143","volume":"65","author":"HQ Ngo","year":"2018","unstructured":"Ngo, H.Q., Porat, E., R\u00e9, C., Rudra, A.: Worst-case optimal join algorithms. J. ACM (JACM) 65(3), 1\u201340 (2018)","journal-title":"J. ACM (JACM)"},{"key":"856_CR54","doi-asserted-by":"publisher","unstructured":"Nodehi\u00a0Sabet, A.H., Qiu, J., Zhao, Z.: Tigr: Transforming irregular graphs for gpu-friendly graph processing. In: Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS \u201918, pp. 622\u2013636. Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3173162.3173180","DOI":"10.1145\/3173162.3173180"},{"key":"856_CR55","doi-asserted-by":"crossref","unstructured":"Pagh, R., Silvestri, F.: The input\/output complexity of triangle enumeration. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 224\u2013233 (2014)","DOI":"10.1145\/2594538.2594552"},{"issue":"11","key":"856_CR56","doi-asserted-by":"publisher","first-page":"2646","DOI":"10.1109\/TPDS.2021.3064892","volume":"32","author":"S Pandey","year":"2021","unstructured":"Pandey, S., Wang, Z., Zhong, S., Tian, C., Zheng, B., Li, X., Li, L., Hoisie, A., Ding, C., Li, D., et al.: Trust: Triangle counting reloaded on gpus. IEEE Trans. Parallel Distrib. Syst. 32(11), 2646\u20132660 (2021)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"856_CR57","doi-asserted-by":"crossref","unstructured":"Park, H.M., Chung, C.W.: An efficient mapreduce algorithm for counting triangles in a very large graph. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 539\u2013548 (2013)","DOI":"10.1145\/2505515.2505563"},{"key":"856_CR58","doi-asserted-by":"crossref","unstructured":"Pinar, A., Seshadhri, C., Vishal, V.: Escape: Efficiently counting all 5-vertex subgraphs. In: Proceedings of the 26th International Conference on World Wide Web, pp. 1431\u20131440 (2017)","DOI":"10.1145\/3038912.3052597"},{"key":"856_CR59","doi-asserted-by":"crossref","unstructured":"Polak, A.: Counting Triangles in Large Graphs on GPU. In: IPDPSW, pp. 740\u2013746. IEEE (2016)","DOI":"10.1109\/IPDPSW.2016.108"},{"key":"856_CR60","unstructured":"Qian, Z., Min, C., Lai, L., Fang, Y., Li, G., Yao, Y., Lyu, B., Zhou, X., Chen, Z., Zhou, J.: GAIA: A system for interactive analysis on distributed graphs using a High-Level language. In: 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21), pp. 321\u2013335. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/nsdi21\/presentation\/qian-zhengping"},{"issue":"1","key":"856_CR61","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/B:CMOT.0000032580.12184.c0","volume":"10","author":"G Robins","year":"2004","unstructured":"Robins, G., Alexander, M.: Small worlds among interlocking directors: network structure and distance in bipartite graphs. Comput. Math. Organiz. Theory 10(1), 69\u201394 (2004)","journal-title":"Comput. Math. Organiz. Theory"},{"key":"856_CR62","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). https:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"856_CR63","doi-asserted-by":"crossref","unstructured":"Roy, A., Bindschaedler, L., Malicevic, J., Zwaenepoel, W.: Chaos: Scale-out graph processing from secondary storage. In: Proceedings of the 25th Symposium on Operating Systems Principles, pp. 410\u2013424 (2015)","DOI":"10.1145\/2815400.2815408"},{"key":"856_CR64","doi-asserted-by":"crossref","unstructured":"Roy, A., Mihailovic, I., Zwaenepoel, W.: X-stream: Edge-centric graph processing using streaming partitions. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pp. 472\u2013488 (2013)","DOI":"10.1145\/2517349.2522740"},{"key":"856_CR65","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.V., Sariyuce, A.E., Tirthapura, S.: Butterfly counting in bipartite networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2150\u20132159 (2018)","DOI":"10.1145\/3219819.3220097"},{"key":"856_CR66","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.V., Zhang, Y., Sariy\u00fcce, A.E., Tirthapura, S.: Fleet: butterfly estimation from a bipartite graph stream. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp. 1201\u20131210 (2019)","DOI":"10.1145\/3357384.3357983"},{"key":"856_CR67","doi-asserted-by":"crossref","unstructured":"Shi, J., Shun, J.: Parallel algorithms for butterfly computations. In: Symposium on Algorithmic Principles of Computer Systems, pp. 16\u201330. SIAM (2020)","DOI":"10.1137\/1.9781611976021.2"},{"key":"856_CR68","doi-asserted-by":"crossref","unstructured":"Shi, T., Zhai, J., Wang, H., Chen, Q., Zhai, M., Hao, Z., Yang, H., Chen, W.: Graphset: High performance graph mining through equivalent set transformations. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201314 (2023)","DOI":"10.1145\/3581784.3613213"},{"key":"856_CR69","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 135\u2013146 (2013)","DOI":"10.1145\/2442516.2442530"},{"key":"856_CR70","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425","author":"X Su","year":"2009","unstructured":"Su, X., Khoshgoftaar, T.M.: A survey of collaborative filtering techniques. Adv. Artif. Intell. (2009). https:\/\/doi.org\/10.1155\/2009\/421425","journal-title":"Adv. Artif. Intell."},{"issue":"8","key":"856_CR71","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990). https:\/\/doi.org\/10.1145\/79173.79181","journal-title":"Commun. ACM"},{"key":"856_CR72","unstructured":"Vora, K.: $$\\{$$LUMOS$$\\}$$:$$\\{$$Dependency-Driven$$\\}$$ disk-based graph processing. In: 2019 USENIX Annual Technical Conference (USENIX ATC 19), pp. 429\u2013442 (2019)"},{"key":"856_CR73","unstructured":"Vora, K., Xu, G., Gupta, R.: Load the edges you need: A generic $$\\{$$I\/O$$\\}$$ optimization for disk-based graph processing. In: 2016 USENIX Annual Technical Conference (USENIX ATC 16), pp. 507\u2013522 (2016)"},{"key":"856_CR74","unstructured":"Vuppalapati, M., Miron, J., Agarwal, R., Truong, D., Motivala, A., Cruanes, T.: Building an elastic query engine on disaggregated storage. In: 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20), pp. 449\u2013462. USENIX Association, Santa Clara, CA (2020). https:\/\/www.usenix.org\/conference\/nsdi20\/presentation\/vuppalapati"},{"key":"856_CR75","doi-asserted-by":"crossref","unstructured":"Wahib, M., Maruyama, N.: Scalable kernel fusion for memory-bound gpu applications. In: SC\u201914: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 191\u2013202. IEEE (2014)","DOI":"10.1109\/SC.2014.21"},{"key":"856_CR76","doi-asserted-by":"crossref","unstructured":"Wang, J., Fu, A.W.C., Cheng, J.: Rectangle counting in large bipartite graphs. In: 2014 IEEE International Congress on Big Data, pp. 17\u201324. IEEE (2014)","DOI":"10.1109\/BigData.Congress.2014.13"},{"key":"856_CR77","doi-asserted-by":"crossref","unstructured":"Wang, K., Hu, Y., Lin, X., Zhang, W., Qin, L., Zhang, Y.: A cohesive structure based bipartite graph analytics system. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 4799\u20134803 (2021)","DOI":"10.1145\/3459637.3481963"},{"issue":"10","key":"856_CR78","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.14778\/3339490.3339497","volume":"12","author":"K Wang","year":"2019","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Vertex priority based butterfly counting for large-scale bipartite networks. Proc. VLDB Endow. 12(10), 1139\u20131152 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"856_CR79","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 661\u2013672. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00063"},{"key":"856_CR80","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Accelerated butterfly counting with vertex priority on bipartite graphs. VLDB J. 1\u201325 (2022)","DOI":"10.1007\/s00778-022-00746-0"},{"issue":"2","key":"856_CR81","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00778-021-00658-5","volume":"31","author":"K Wang","year":"2022","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. VLDB J. 31(2), 203\u2013226 (2022)","journal-title":"VLDB J."},{"key":"856_CR82","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Zhang, Y., Qin, L., Zhang, Y.: Discovering significant communities on bipartite graphs: an index-based approach. IEEE Trans. Knowl. Data Eng. (2021)","DOI":"10.1109\/TKDE.2021.3111349"},{"key":"856_CR83","doi-asserted-by":"publisher","DOI":"10.1145\/3016078.2851145","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Davidson, A., Pan, Y., Wu, Y., Riffel, A., Owens, J.D.: Gunrock: A high-performance graph processing library on the gpu. SIGPLAN Not. (2016). https:\/\/doi.org\/10.1145\/3016078.2851145","journal-title":"SIGPLAN Not."},{"key":"856_CR84","doi-asserted-by":"crossref","unstructured":"Wang, Z., Meng, Z., Li, X., Lin, X., Zheng, L., Tian, C., Zhong, S.: Smog: Accelerating subgraph matching on gpus. In: 2023 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20137. IEEE (2023)","DOI":"10.1109\/HPEC58863.2023.10363569"},{"issue":"8","key":"856_CR85","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/2517327.2442523","volume":"48","author":"B Wu","year":"2013","unstructured":"Wu, B., Zhao, Z., Zhang, E.Z., Jiang, Y., Shen, X.: Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on gpu. ACM SIGPLAN Notices 48(8), 57\u201368 (2013)","journal-title":"ACM SIGPLAN Notices"},{"issue":"11","key":"856_CR86","doi-asserted-by":"publisher","first-page":"2450","DOI":"10.14778\/3551793.3551806","volume":"15","author":"Q Xu","year":"2022","unstructured":"Xu, Q., Zhang, F., Yao, Z., Lu, L., Du, X., Deng, D., He, B.: Efficient load-balanced butterfly counting on gpu. Proc. VLDB Endow. 15(11), 2450\u20132462 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"856_CR87","doi-asserted-by":"crossref","unstructured":"Yang, Z., Lai, L., Lin, X., Hao, K., Zhang, W.: Huge: An efficient and scalable subgraph enumeration system. In: Proceedings of the 2021 International Conference on Management of Data, pp. 2049\u20132062 (2021)","DOI":"10.1145\/3448016.3457237"},{"key":"856_CR88","doi-asserted-by":"crossref","unstructured":"Ya\u015far, A., Rajamanickam, S., Berry, J., Wolf, M., Young, J.S., \u00c7ataly\u00dcrek, \u00dc.V.: Linear Algebra-Based Triangle Counting via Fine-Grained Tasking on Heterogeneous Environments: (Update on Static Graph Challenge). In: HPEC, pp. 1\u20134 (2019)","DOI":"10.1109\/HPEC.2019.8916233"},{"key":"856_CR89","doi-asserted-by":"crossref","unstructured":"Zeng, L., Zou, L., \u00d6zsu, M.T., Hu, L., Zhang, F.: Gsi: Gpu-friendly subgraph isomorphism. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 1249\u20131260. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00112"},{"issue":"4","key":"856_CR90","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3626753","volume":"1","author":"F Zhang","year":"2023","unstructured":"Zhang, F., Chen, D., Wang, S., Yang, Y., Gan, J.: Scalable approximate butterfly and bi-triangle counting for large bipartite networks. Proc. ACM Manag. Data 1(4), 1\u201326 (2023)","journal-title":"Proc. ACM Manag. Data"},{"issue":"12","key":"856_CR91","doi-asserted-by":"publisher","first-page":"2493","DOI":"10.14778\/3407790.3407840","volume":"13","author":"H Zhang","year":"2020","unstructured":"Zhang, H., Yu, J.X., Zhang, Y., Zhao, K., Cheng, H.: Distributed subgraph counting: a general approach. Proc. VLDB Endow. 13(12), 2493\u20132507 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"856_CR92","doi-asserted-by":"publisher","unstructured":"Zhang, J., Li, J.: Degree-aware hybrid graph traversal on fpga-hmc platform. In: Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays, FPGA \u201918, pp. 229\u2013238. Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3174243.3174245","DOI":"10.1145\/3174243.3174245"},{"key":"856_CR93","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-24123-4_5","volume-title":"Advances in Digital Forensics XI","author":"C Zhao","year":"2015","unstructured":"Zhao, C., Guan, Y.: A graph-based investigation of bitcoin transactions. In: Peterson, G., Shenoi, S. (eds.) Advances in Digital Forensics XI, pp. 79\u201395. Springer International Publishing, Cham (2015)"},{"key":"856_CR94","doi-asserted-by":"crossref","unstructured":"Zhao, G., Wang, K., Zhang, W., Lin, X., Zhang, Y., He, Y.: Efficient computation of cohesive subgraphs in uncertain bipartite graphs. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 2333\u20132345. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00220"},{"key":"856_CR95","doi-asserted-by":"publisher","unstructured":"Zhao, T., Malir, M., Jiang, M.: Actionable objective optimization for suspicious behavior detection on large bipartite graphs. In: 2018 IEEE International Conference on Big Data (Big Data), pp. 1248\u20131257 (2018). https:\/\/doi.org\/10.1109\/BigData.2018.8621975","DOI":"10.1109\/BigData.2018.8621975"},{"issue":"2","key":"856_CR96","doi-asserted-by":"publisher","first-page":"211","DOI":"10.14778\/3489496.3489502","volume":"15","author":"A Zhou","year":"2021","unstructured":"Zhou, A., Wang, Y., Chen, L.: Butterfly counting on uncertain bipartite graphs. Proc. VLDB Endow. 15(2), 211\u2013223 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"856_CR97","doi-asserted-by":"publisher","unstructured":"Zhu, Q., Zheng, J., Yang, H., Chen, C., Wang, X., Zhang, Y.: Hurricane in bipartite graphs: The lethal nodes of butterflies. In: 32nd International Conference on Scientific and Statistical Database Management, SSDBM 2020. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3400903.3400916","DOI":"10.1145\/3400903.3400916"},{"key":"856_CR98","doi-asserted-by":"crossref","unstructured":"Zhu, R., Zou, Z., Li, J.: Fast rectangle counting on massive networks. In: 2018 IEEE International Conference on Data Mining (ICDM), pp. 847\u2013856. IEEE (2018)","DOI":"10.1109\/ICDM.2018.00100"},{"key":"856_CR99","unstructured":"Zhu, X., Han, W., Chen, W.: $$\\{$$GridGraph$$\\}$$:$$\\{$$Large-Scale$$\\}$$ graph processing on a single machine using 2-level hierarchical partitioning. In: 2015 USENIX Annual Technical Conference (USENIX ATC 15), pp. 375\u2013386 (2015)"},{"issue":"3","key":"856_CR100","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s13278-011-0021-0","volume":"1","author":"KA Zweig","year":"2011","unstructured":"Zweig, K.A., Kaufmann, M.: A systematic approach to the one-mode projection of bipartite graphs. Soc. Netw. Anal. Min. 1(3), 187\u2013218 (2011)","journal-title":"Soc. Netw. Anal. Min."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00856-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00856-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00856-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T11:20:50Z","timestamp":1732188050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00856-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,7]]},"references-count":100,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["856"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00856-x","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,7]]},"assertion":[{"value":"30 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research involving human participants and\/or animals"}},{"value":"As this study does not involve human participants, informed consent is not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}