{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:41:05Z","timestamp":1773895265160,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":90,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Key R&D Program of China","award":["2018AAA0102502"],"award-info":[{"award-number":["2018AAA0102502"]}]},{"name":"Australian Research Council Discovery Project","award":["DP200101338,DP200101116,DP210101393"],"award-info":[{"award-number":["DP200101338,DP200101116,DP210101393"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457237","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"2049-2062","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["HUGE: An Efficient and Scalable Subgraph Enumeration System"],"prefix":"10.1145","author":[{"given":"Zhengyi","family":"Yang","sequence":"first","affiliation":[{"name":"The University of New South Wales, Sydney, NSW, Australia"}]},{"given":"Longbin","family":"Lai","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, NSW, Australia"}]},{"given":"Kongzhang","family":"Hao","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, NSW, Australia"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, NSW, Australia"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation","author":"Abadi Mart'in","year":"2016","unstructured":"Mart'in Abadi , Paul Barham , Jianmin Chen , Zhifeng Chen , Andy Davis , Jeffrey Dean , Matthieu Devin , Sanjay Ghemawat , Geoffrey Irving , Michael Isard , Manjunath Kudlur , Josh Levenberg , Rajat Monga , Sherry Moore , Derek G. Murray , Benoit Steiner , Paul Tucker , Vijay Vasudevan , Pete Warden , Martin Wicke , Yuan Yu , and Xiaoqiang Zheng . 2016 . TensorFlow: A System for Large-Scale Machine Learning . In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation ( Savannah, GA, USA) (OSDI'16). USENIX Association, USA, 265--283. Mart'in Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, Manjunath Kudlur, Josh Levenberg, Rajat Monga, Sherry Moore, Derek G. Murray, Benoit Steiner, Paul Tucker, Vijay Vasudevan, Pete Warden, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng. 2016. TensorFlow: A System for Large-Scale Machine Learning. In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (Savannah, GA, USA) (OSDI'16). USENIX Association, USA, 265--283."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915213"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544814"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn163"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3184470.3184473"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.43"},{"key":"e_1_3_2_2_7_1","volume-title":"Proceedings of the 2019 International Conference on Management of Data","author":"Bhattarai Bibek","unstructured":"Bibek Bhattarai , Hang Liu , and H. Howie Huang . 2019. CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching . In Proceedings of the 2019 International Conference on Management of Data ( Amsterdam, Netherlands) (SIGMOD '19). Association for Computing Machinery, New York, NY, USA, 1447--1462. Bibek Bhattarai, Hang Liu, and H. Howie Huang. 2019. CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching. In Proceedings of the 2019 International Conference on Management of Data (Amsterdam, Netherlands) (SIGMOD '19). Association for Computing Machinery, New York, NY, USA, 1447--1462."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_2_10_1","unstructured":"Caffeine. 2020 a. Caffeine Cache. https:\/\/github.com\/ben-manes\/caffeine .  Caffeine. 2020 a. Caffeine Cache. https:\/\/github.com\/ben-manes\/caffeine ."},{"key":"e_1_3_2_2_11_1","unstructured":"Caffeine. 2020 b. Caffeine Cache Benchmarks. https:\/\/github.com\/ben-manes\/caffeine\/wiki\/Benchmarks .  Caffeine. 2020 b. Caffeine Cache Benchmarks. https:\/\/github.com\/ben-manes\/caffeine\/wiki\/Benchmarks ."},{"key":"e_1_3_2_2_12_1","volume-title":"Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3","author":"Carletti Vincenzo","year":"2017","unstructured":"Vincenzo Carletti , Pasquale Foggia , Alessia Saggese , and Mario Vento . 2017. Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3 . IEEE transactions on pattern analysis and machine intelligence , Vol. 40 , 4 ( 2017 ), 804--818. Vincenzo Carletti, Pasquale Foggia, Alessia Saggese, and Mario Vento. 2017. Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3. IEEE transactions on pattern analysis and machine intelligence , Vol. 40, 4 (2017), 804--818."},{"key":"e_1_3_2_2_13_1","unstructured":"Cassandra. 2020. Apache Cassandra. https:\/\/cassandra.apache.org  Cassandra. 2020. Apache Cassandra. https:\/\/cassandra.apache.org"},{"key":"e_1_3_2_2_14_1","unstructured":"The DIMACS Implementation Challenge. 2006. The Challenge9 datasets. http:\/\/www.dis.uniroma1.it\/challenge9 .  The DIMACS Implementation Challenge. 2006. The Challenge9 datasets. http:\/\/www.dis.uniroma1.it\/challenge9 ."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073974"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00211"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0937490100"},{"key":"e_1_3_2_2_19_1","volume-title":"Cosma Rohilla Shalizi, and Mark EJ Newman","author":"Clauset Aaron","year":"2009","unstructured":"Aaron Clauset , Cosma Rohilla Shalizi, and Mark EJ Newman . 2009 . Power-law distributions in empirical data. SIAM review , Vol. 51 , 4 (2009), 661--703. Aaron Clauset, Cosma Rohilla Shalizi, and Mark EJ Newman. 2009. Power-law distributions in empirical data. SIAM review , Vol. 51, 4 (2009), 661--703."},{"key":"e_1_3_2_2_20_1","volume-title":"Carlo Sansone, and Mario Vento","author":"Cordella Luigi P","year":"2004","unstructured":"Luigi P Cordella , Pasquale Foggia , Carlo Sansone, and Mario Vento . 2004 . A (sub) graph isomorphism algorithm for matching large graphs. IEEE transactions on pattern analysis and machine intelligence , Vol. 26 , 10 (2004), 1367--1372. Luigi P Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. 2004. A (sub) graph isomorphism algorithm for matching large graphs. IEEE transactions on pattern analysis and machine intelligence , Vol. 26, 10 (2004), 1367--1372."},{"key":"e_1_3_2_2_21_1","volume-title":"MapReduce: Simplified Data Processing on Large Clusters. In OSDI'04: Sixth Symposium on Operating System Design and Implementation","author":"Dean Jeffrey","year":"2004","unstructured":"Jeffrey Dean and Sanjay Ghemawat . 2004 . MapReduce: Simplified Data Processing on Large Clusters. In OSDI'04: Sixth Symposium on Operating System Design and Implementation . San Francisco, CA, 137--150. Jeffrey Dean and Sanjay Ghemawat. 2004. MapReduce: Simplified Data Processing on Large Clusters. In OSDI'04: Sixth Symposium on Operating System Design and Implementation. San Francisco, CA, 137--150."},{"key":"e_1_3_2_2_22_1","volume-title":"Proceedings of the 11th International Conference on Very Large Data Bases -","volume":"11","author":"David","unstructured":"David J. DeWitt and Robert H. Gerber. 1985. Multiprocessor Hash-Based Join Algorithms . In Proceedings of the 11th International Conference on Very Large Data Bases - Volume 11 (Stockholm, Sweden) (VLDB '85). VLDB Endowment, 151--164. David J. DeWitt and Robert H. Gerber. 1985. Multiprocessor Hash-Based Join Algorithms. In Proceedings of the 11th International Conference on Very Large Data Bases - Volume 11 (Stockholm, Sweden) (VLDB '85). VLDB Endowment, 151--164."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319875"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149371"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824048"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.989932"},{"key":"e_1_3_2_2_27_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S . Johnson . 1979 . Computers and Intractability; A Guide to the Theory of NP-Completeness .W. H. Freeman & Co. , New York, NY, USA. 203 pages. Michael R. Garey and David S. Johnson. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness .W. H. Freeman & Co., New York, NY, USA. 203 pages."},{"key":"e_1_3_2_2_28_1","volume-title":"Grochow and Manolis Kellis","author":"Joshua","year":"2007","unstructured":"Joshua A. Grochow and Manolis Kellis . 2007 . Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. In Research in Computational Molecular Biology, Terry Speed and Haiyan Huang (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg, 92--106. Joshua A. Grochow and Manolis Kellis. 2007. Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. In Research in Computational Molecular Biology, Terry Speed and Haiyan Huang (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 92--106."},{"key":"e_1_3_2_2_29_1","unstructured":"Hadoop. 2020. Apache Hadoop. https:\/\/hadoop.apache.org .  Hadoop. 2020. Apache Hadoop. https:\/\/hadoop.apache.org ."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357840"},{"key":"e_1_3_2_2_33_1","unstructured":"HBase. 2020. Apache HBase. https:\/\/hbase.apache.org .  HBase. 2020. Apache HBase. https:\/\/hbase.apache.org ."},{"key":"e_1_3_2_2_34_1","volume-title":"Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data","author":"He Huahai","unstructured":"Huahai He and Ambuj K. Singh . 2008. 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 ( Vancouver, Canada) (SIGMOD '08). Association for Computing Machinery, New York, NY, USA, 405--418. Huahai He and Ambuj K. Singh. 2008. 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 (Vancouver, Canada) (SIGMOD '08). Association for Computing Machinery, New York, NY, USA, 405--418."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2766634"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"e_1_3_2_2_37_1","volume-title":"Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data","author":"Yannis","unstructured":"Yannis E. Ioannidis and Younkyung Cha Kang. 1991. Left-Deep vs. Bushy Trees: An Analysis of Strategy Spaces and Its Implications for Query Optimization . In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data ( Denver, Colorado, USA) (SIGMOD '91). Association for Computing Machinery, New York, NY, USA, 168--177. https:\/\/doi.org\/10.1145\/115790.115813 10.1145\/115790.115813 Yannis E. Ioannidis and Younkyung Cha Kang. 1991. Left-Deep vs. Bushy Trees: An Analysis of Strategy Spaces and Its Implications for Query Optimization. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data (Denver, Colorado, USA) (SIGMOD '91). Association for Computing Machinery, New York, NY, USA, 168--177. https:\/\/doi.org\/10.1145\/115790.115813"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_3_2_2_39_1","volume-title":"FAST: FPGA-based Subgraph Matching on Massive Graphs. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE.","author":"Jin Xin","year":"2021","unstructured":"Xin Jin , Zhengyi Yang , Xuemin Lin , Shiyu Yang , Lu Qin , and You Peng . 2021 . FAST: FPGA-based Subgraph Matching on Massive Graphs. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE. Xin Jin, Zhengyi Yang, Xuemin Lin, Shiyu Yang, Lu Qin, and You Peng. 2021. FAST: FPGA-based Subgraph Matching on Massive Graphs. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE."},{"key":"e_1_3_2_2_40_1","unstructured":"Kafka. 2020. Apache Kafka. http:\/\/kafka.apache.org\/.  Kafka. 2020. Apache Kafka. http:\/\/kafka.apache.org\/."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124374"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056445"},{"key":"e_1_3_2_2_43_1","volume-title":"Proceedings of the 2016 International Conference on Management of Data","author":"Kim Hyeonji","unstructured":"Hyeonji Kim , Juneyoung Lee , Sourav S. Bhowmick , Wook-Shin Han , JeongHoon Lee , Seongyun Ko , and Moath H.A. Jarrah . 2016. DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine . In Proceedings of the 2016 International Conference on Management of Data ( San Francisco, California, USA) (SIGMOD '16). Association for Computing Machinery, New York, NY, USA, 1231--1245. Hyeonji Kim, Juneyoung Lee, Sourav S. Bhowmick, Wook-Shin Han, JeongHoon Lee, Seongyun Ko, and Moath H.A. Jarrah. 2016. DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine. In Proceedings of the 2016 International Conference on Management of Data (San Francisco, California, USA) (SIGMOD '16). Association for Computing Machinery, New York, NY, USA, 1231--1245."},{"key":"e_1_3_2_2_44_1","volume-title":"Shared Memory Parallel Subgraph Enumeration. In 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 519--529","author":"Kimmig R.","unstructured":"R. Kimmig , H. Meyerhenke , and D. Strash . 2017 . Shared Memory Parallel Subgraph Enumeration. In 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 519--529 . R. Kimmig, H. Meyerhenke, and D. Strash. 2017. Shared Memory Parallel Subgraph Enumeration. In 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). 519--529."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794368"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021937"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339494"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/11731139_44"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_3_2_2_52_1","volume-title":"Science","volume":"298","author":"Milo Ron","year":"2002","unstructured":"Ron Milo , Shai Shen-Orr , Shalev Itzkovitz , Nadav Kashtan , Dmitri Chklovskii , and Uri Alon . 2002 . Network motifs: simple building blocks of complex networks . Science , Vol. 298 , 5594 (2002), 824--827. Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: simple building blocks of complex networks. Science , Vol. 298, 5594 (2002), 824--827."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_3_2_2_55_1","unstructured":"Neo4j. 2020. Neo4j. https:\/\/neo4j.com\/.  Neo4j. 2020. Neo4j. https:\/\/neo4j.com\/."},{"key":"e_1_3_2_2_56_1","first-page":"4","article-title":"Skew Strikes Back","volume":"42","author":"Ngo Hung Q","year":"2014","unstructured":"Hung Q Ngo , Christopher R\u00e9 , and Atri Rudra . 2014 . Skew Strikes Back : New Developments in the Theory of Join Algorithms. SIGMOD Rec. , Vol. 42 , 4 (Feb. 2014), 5--16. Hung Q Ngo, Christopher R\u00e9, and Atri Rudra. 2014. Skew Strikes Back: New Developments in the Theory of Join Algorithms. SIGMOD Rec. , Vol. 42, 4 (Feb. 2014), 5--16.","journal-title":"New Developments in the Theory of Join Algorithms. SIGMOD Rec."},{"key":"e_1_3_2_2_57_1","unstructured":"openCypher. 2020. openCypher. https:\/\/www.opencypher.org .  openCypher. 2020. openCypher. https:\/\/www.opencypher.org ."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389702"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372720"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.10.005"},{"key":"e_1_3_2_2_61_1","unstructured":"The Lemur Project. 2018. The Clubweb12 dataset. https:\/\/lemurproject.org\/clueweb12 .  The Lemur Project. 2018. The Clubweb12 dataset. https:\/\/lemurproject.org\/clueweb12 ."},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl030"},{"key":"e_1_3_2_2_63_1","first-page":"2","article-title":"Subgraph Matching","volume":"11","author":"Qiao Miao","year":"2017","unstructured":"Miao Qiao , Hao Zhang , and Hong Cheng . 2017 . Subgraph Matching : On Compression and Computation. Proc. VLDB Endow. , Vol. 11 , 2 (Oct. 2017), 176--188. Miao Qiao, Hao Zhang, and Hong Cheng. 2017. Subgraph Matching: On Compression and Computation. Proc. VLDB Endow. , Vol. 11, 2 (Oct. 2017), 176--188.","journal-title":"On Compression and Computation. Proc. VLDB Endow."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2621934.2621939"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90024-9"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342272"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164139"},{"key":"e_1_3_2_2_68_1","volume-title":"Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data","author":"Donovan","unstructured":"Donovan A. Schneider and David J. DeWitt. 1989. A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment . In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data ( Portland, Oregon, USA) (SIGMOD '89). Association for Computing Machinery, New York, NY, USA, 110--121. https:\/\/doi.org\/10.1145\/67544.66937 10.1145\/67544.66937 Donovan A. Schneider and David J. DeWitt. 1989. A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data (Portland, Oregon, USA) (SIGMOD '89). Association for Computing Machinery, New York, NY, USA, 110--121. https:\/\/doi.org\/10.1145\/67544.66937"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3127479.3131625"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588557"},{"key":"e_1_3_2_2_72_1","volume-title":"EMP: Zero-Copy OS-Bypass NIC-Driven Gigabit Ethernet Message Passing. In SC '01: Proceedings of the 2001 ACM\/IEEE Conference on Supercomputing. 49--49","author":"Shivam P.","year":"2034","unstructured":"P. Shivam , P. Wyckoff , and D. Panda . 2001 . EMP: Zero-Copy OS-Bypass NIC-Driven Gigabit Ethernet Message Passing. In SC '01: Proceedings of the 2001 ACM\/IEEE Conference on Supercomputing. 49--49 . https:\/\/doi.org\/10.1145\/58 2034 .582091 10.1145\/582034.582091 P. Shivam, P. Wyckoff, and D. Panda. 2001. EMP: Zero-Copy OS-Bypass NIC-Driven Gigabit Ethernet Message Passing. In SC '01: Proceedings of the 2001 ACM\/IEEE Conference on Supercomputing. 49--49. https:\/\/doi.org\/10.1145\/582034.582091"},{"key":"e_1_3_2_2_73_1","unstructured":"Stanford SNAP. 2020. The SNAP datasets. http:\/\/snap.stanford.edu\/data\/index.html .  Stanford SNAP. 2020. The SNAP datasets. http:\/\/snap.stanford.edu\/data\/index.html ."},{"key":"e_1_3_2_2_74_1","volume-title":"2012 USENIX Annual Technical Conference (USENIX ATC 12)","author":"Song Xiang","year":"2012","unstructured":"Xiang Song , Jicheng Shi , Haibo Chen , and Binyu Zang . 2012 . Revisiting software zero-copy for web-caching applications with twin memory allocation . In 2012 USENIX Annual Technical Conference (USENIX ATC 12) . 355--360. Xiang Song, Jicheng Shi, Haibo Chen, and Binyu Zang. 2012. Revisiting software zero-copy for web-caching applications with twin memory allocation. In 2012 USENIX Annual Technical Conference (USENIX ATC 12) . 355--360."},{"key":"e_1_3_2_2_75_1","unstructured":"Spark. 2020. Apache Spark. https:\/\/spark.apache.org .  Spark. 2020. Apache Spark. https:\/\/spark.apache.org ."},{"key":"e_1_3_2_2_76_1","unstructured":"Storm. 2020. Apache Storm. http:\/\/storm.apache.org\/index.html .  Storm. 2020. Apache Storm. http:\/\/storm.apache.org\/index.html ."},{"key":"e_1_3_2_2_77_1","volume-title":"2019 IEEE 35th International Conference on Data Engineering (ICDE). 232--243","author":"Sun S.","unstructured":"S. Sun , Y. Che , L. Wang , and Q. Luo . 2019. Efficient Parallel Subgraph Enumeration on a Single Machine . In 2019 IEEE 35th International Conference on Data Engineering (ICDE). 232--243 . S. Sun, Y. Che , L. Wang, and Q. Luo. 2019. Efficient Parallel Subgraph Enumeration on a Single Machine. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). 232--243."},{"key":"e_1_3_2_2_78_1","volume-title":"2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) . 1--9.","author":"Sun S.","unstructured":"S. Sun and Q. Luo . 2018. Parallelizing Recursive Backtracking Based Subgraph Matching on a Single Machine . In 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) . 1--9. S. Sun and Q. Luo. 2018. Parallelizing Recursive Backtracking Based Subgraph Matching on a Single Machine. In 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) . 1--9."},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_3_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339497"},{"key":"e_1_3_2_2_84_1","volume-title":"BENU: Distributed Subgraph Enumeration with Backtracking-Based Framework. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). IEEE, 136--147","author":"Wang Zhaokang","year":"2019","unstructured":"Zhaokang Wang , Rong Gu , Weiwei Hu , Chunfeng Yuan , and Yihua Huang . 2019 a . BENU: Distributed Subgraph Enumeration with Backtracking-Based Framework. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). IEEE, 136--147 . Zhaokang Wang, Rong Gu, Weiwei Hu, Chunfeng Yuan, and Yihua Huang. 2019 a. BENU: Distributed Subgraph Enumeration with Backtracking-Based Framework. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). IEEE, 136--147."},{"key":"e_1_3_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"e_1_3_2_2_86_1","volume-title":"HUGE: An Efficient and Scalable Subgraph Enumeration System. https:\/\/arxiv.org\/pdf\/2103.14294.pdf .","author":"Yang Zhengyi","year":"2021","unstructured":"Zhengyi Yang , Longbin Lai , Xuemin Lin , Kongzhang Hao , and Wenjie Zhang . 2021 . HUGE: An Efficient and Scalable Subgraph Enumeration System. https:\/\/arxiv.org\/pdf\/2103.14294.pdf . Zhengyi Yang, Longbin Lai, Xuemin Lin, Kongzhang Hao, and Wenjie Zhang. 2021. HUGE: An Efficient and Scalable Subgraph Enumeration System. https:\/\/arxiv.org\/pdf\/2103.14294.pdf ."},{"key":"e_1_3_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/3123878.3131975"},{"key":"e_1_3_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516384"},{"key":"e_1_3_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"},{"key":"e_1_3_2_2_90_1","volume-title":"Commodity Hardware. In Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis","author":"Zheng Da","unstructured":"Da Zheng , Randal Burns , and Alexander S. Szalay . 2013. Toward Millions of File System IOPS on Low-Cost , Commodity Hardware. In Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis ( Denver, Colorado) (SC '13). Association for Computing Machinery, New York, NY, USA, Article 69, bibinfonumpages12 pages. Da Zheng, Randal Burns, and Alexander S. Szalay. 2013. Toward Millions of File System IOPS on Low-Cost, Commodity Hardware. In Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis (Denver, Colorado) (SC '13). Association for Computing Machinery, New York, NY, USA, Article 69, bibinfonumpages12 pages."},{"key":"e_1_3_2_2_91_1","volume-title":"Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation","author":"Zhu Xiaowei","year":"2016","unstructured":"Xiaowei Zhu , Wenguang Chen , Weimin Zheng , and Xiaosong Ma . 2016 . Gemini: A Computation-Centric Distributed Graph Processing System . In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation ( Savannah, GA, USA) (OSDI'16). USENIX Association, USA, 301--316. Xiaowei Zhu, Wenguang Chen, Weimin Zheng, and Xiaosong Ma. 2016. Gemini: A Computation-Centric Distributed Graph Processing System. In Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation (Savannah, GA, USA) (OSDI'16). USENIX Association, USA, 301--316."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457237","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:05Z","timestamp":1750195685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":90,"alternative-id":["10.1145\/3448016.3457237","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457237","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}