{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:37Z","timestamp":1750219777142,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSFC","award":["U20A20174, U20A20181"],"award-info":[{"award-number":["U20A20174, U20A20181"]}]},{"name":"Science and Technology Major Projects of Changsha City","award":["kh2103003"],"award-info":[{"award-number":["kh2103003"]}]},{"name":"National Key R\\&D Projects","award":["2022YFB3103500, 2022YFE0137700"],"award-info":[{"award-number":["2022YFB3103500, 2022YFE0137700"]}]},{"name":"Hunan Provincial Natural Science Foundation of China","award":["2022JJ30165"],"award-info":[{"award-number":["2022JJ30165"]}]},{"name":"Technology Projects of Hunan Province","award":["2019WK2072, 2015TP1004"],"award-info":[{"award-number":["2019WK2072, 2015TP1004"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599419","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:13:58Z","timestamp":1691172838000},"page":"1885-1896","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Locality Sensitive Hashing for Optimizing Subgraph Query Processing in Parallel Computing Systems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8095-8061","authenticated-orcid":false,"given":"Peng","family":"Peng","sequence":"first","affiliation":[{"name":"Hunan University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3254-2152","authenticated-orcid":false,"given":"Shengyi","family":"Ji","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-1915-3423","authenticated-orcid":false,"given":"Zhen","family":"Tian","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7372-2539","authenticated-orcid":false,"given":"Hongbo","family":"Jiang","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1200-7368","authenticated-orcid":false,"given":"Weiguo","family":"Zheng","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8638-2985","authenticated-orcid":false,"given":"Xuecang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei Technologies, Shenzhen, China"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"197","volume-title":"ISWC","author":"Alu\u00e7 G.","year":"2014","unstructured":"G. Alu\u00e7 , O. Hartig , M. T. \u00d6zsu , and K. Daudjee . Diversified Stress Testing of RDF Data Management Systems . In ISWC , pages 197 -- 212 , Cham , 2014 . Springer International Publishing. G. Alu\u00e7, O. Hartig, M. T. \u00d6zsu, and K. Daudjee. Diversified Stress Testing of RDF Data Management Systems. In ISWC, pages 197--212, Cham, 2014. Springer International Publishing."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1007\/s00778-018-0530-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.14778\/3184470.3184473"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.1109\/FOCS.2006.49"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1145\/2882903.2915236"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_6_1","DOI":"10.1109\/ASONAM.2010.80"},{"key":"e_1_3_2_2_7_1","volume-title":"USA","author":"Broder A.","year":"1997","unstructured":"A. Broder . On the resemblance and containment of documents. In SEQUENCES, page 21 , USA , 1997 . IEEE Computer Society. A. Broder. On the resemblance and containment of documents. In SEQUENCES, page 21, USA, 1997. IEEE Computer Society."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1145\/276698.276781"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_9_1","DOI":"10.5244\/C.22.50"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.1145\/2020408.2020578"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_11_1","DOI":"10.1145\/2274576.2274578"},{"key":"e_1_3_2_2_12_1","volume-title":"SIGMOD, page 337--348","author":"Han W.-S.","year":"2013","unstructured":"W.-S. Han , J. Lee , and J.-H. Lee . Turboiso: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large Graph Databases . In SIGMOD, page 337--348 , New York, NY, USA , 2013 . Association for Computing Machinery . W.-S. Han, J. Lee, and J.-H. Lee. Turboiso: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large Graph Databases. In SIGMOD, page 337--348, New York, NY, USA, 2013. Association for Computing Machinery."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_13_1","DOI":"10.1145\/3219819.3219971"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_14_1","DOI":"10.1201\/9781420035315.ch39"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_15_1","DOI":"10.14778\/3229863.3236246"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_16_1","DOI":"10.1109\/RAICS.2015.7488415"},{"key":"e_1_3_2_2_17_1","volume-title":"What is Twitter, a Social Network or a News Media? In WWW, page 591--600","author":"Kwak H.","year":"2010","unstructured":"H. Kwak , C. Lee , H. Park , and S. Moon . What is Twitter, a Social Network or a News Media? In WWW, page 591--600 , New York, NY, USA , 2010 . Association for Computing Machinery . H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a Social Network or a News Media? In WWW, page 591--600, New York, NY, USA, 2010. Association for Computing Machinery."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_18_1","DOI":"10.14778\/2794367.2794368"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_19_1","DOI":"10.14778\/3021924.3021937"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_20_1","DOI":"10.14778\/3339490.3339494"},{"unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data June 2014.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data June 2014.","key":"e_1_3_2_2_21_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_22_1","DOI":"10.5555\/2787930"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_23_1","DOI":"10.1145\/3196959.3196990"},{"issue":"3","key":"e_1_3_2_2_24_1","first-page":"1","volume":"65","author":"Ngo H. Q.","year":"2018","unstructured":"H. Q. Ngo , E. Porat , C. R\u00e9 , and A. Rudra . Worst-case Optimal Join Algorithms. J. ACM , 65 ( 3 ):16: 1 -- 16 :40, 2018 . H. Q. Ngo, E. Porat, C. R\u00e9, and A. Rudra. Worst-case Optimal Join Algorithms. J. ACM, 65(3):16:1--16:40, 2018.","journal-title":"Worst-case Optimal Join Algorithms. J. ACM"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_25_1","DOI":"10.1093\/bioinformatics\/btl030"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_26_1","DOI":"10.14778\/3021924.3021929"},{"key":"e_1_3_2_2_27_1","volume-title":"SoCC, page 214--228","author":"Serafini M.","year":"2017","unstructured":"M. Serafini , G. De Francisci Morales, and G. Siganos. QFrag: Distributed Graph Search via Subgraph Isomorphism . In SoCC, page 214--228 , New York, NY, USA , 2017 . Association for Computing Machinery . M. Serafini, G. De Francisci Morales, and G. Siganos. QFrag: Distributed Graph Search via Subgraph Isomorphism. In SoCC, page 214--228, New York, NY, USA, 2017. Association for Computing Machinery."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_28_1","DOI":"10.14778\/2311906.2311907"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_29_1","DOI":"10.1145\/1401890.1402008"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_30_1","DOI":"10.1109\/ICDE53745.2022.00214"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_31_1","DOI":"10.1109\/ICDE.2019.00021"},{"key":"e_1_3_2_2_32_1","first-page":"1369","volume-title":"ICDE","author":"Yan D.","year":"2020","unstructured":"D. Yan , G. Guo , M. M. R. Chowdhury , M. T. \u00d6zsu , W. Ku , and J. C. S. Lui . G-thinker : A Distributed Framework for Mining Subgraphs in a Big Graph . In ICDE , pages 1369 -- 1380 , Dallas, TX, USA , 2020 . IEEE. D. Yan, G. Guo, M. M. R. Chowdhury, M. T. \u00d6zsu, W. Ku, and J. C. S. Lui. G-thinker: A Distributed Framework for Mining Subgraphs in a Big Graph. In ICDE, pages 1369--1380, Dallas, TX, USA, 2020. IEEE."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_33_1","DOI":"10.1007\/978-3-319-24075-6_60"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"acronym":"KDD '23","name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA"},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599419","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:36Z","timestamp":1750178256000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":33,"alternative-id":["10.1145\/3580305.3599419","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599419","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}