{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T07:10:03Z","timestamp":1755846603088,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100007085","name":"National University of Defense Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007085","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,12,23]]},"DOI":"10.1145\/3579654.3579686","type":"proceedings-article","created":{"date-parts":[[2023,3,14]],"date-time":"2023-03-14T16:09:40Z","timestamp":1678810180000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A method for accelerating relations search over big data scenario"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5774-951X","authenticated-orcid":false,"given":"Lihua","family":"Liu","sequence":"first","affiliation":[{"name":"College of System Engineering, National University of Defense Technology, China and \rLaboratory for Big Data and Decision, National University of Defense Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2498-6244","authenticated-orcid":false,"given":"Mao","family":"Wang","sequence":"additional","affiliation":[{"name":"College of System Engineering, National University of Defense Technology, China and \rLaboratory for Big Data and Decision, National University of Defense Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3172-7072","authenticated-orcid":false,"given":"Kaiming","family":"Xiao","sequence":"additional","affiliation":[{"name":"College of System Engineering, National University of Defense Technology, China and \rLaboratory for Big Data and Decision, National University of Defense Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8031-8008","authenticated-orcid":false,"given":"Haiwen","family":"Chen","sequence":"additional","affiliation":[{"name":"College of System Engineering, National University of Defense Technology, China and \rLaboratory for Big Data and Decision, National University of Defense Technology, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,3,14]]},"reference":[{"volume-title":"Heterogeneous graph neural networks for malicious account detection[C].Proceedings of the 27th ACM International Conference on Information and Knowledge Management. 2018: 2077-2085","author":"Liu Z","key":"e_1_3_2_1_1_1","unstructured":"Liu Z, Chen C, Yang X, Heterogeneous graph neural networks for malicious account detection[C].Proceedings of the 27th ACM International Conference on Information and Knowledge Management. 2018: 2077-2085."},{"key":"e_1_3_2_1_2_1","first-page":"26","article-title":"Introduction and application of graph data model[J]","volume":"5","author":"He Qi","year":"2021","unstructured":"He Qi. Introduction and application of graph data model[J]. Consume Guide, 2021,(5):26-27.","journal-title":"Consume Guide"},{"volume-title":"Emails as graph: relation discovery in email archive[C]\/\/Proceedings of the 21st International Conference on World Wide Web. 2012: 841-846","author":"Laclav\u00edk M","key":"e_1_3_2_1_3_1","unstructured":"Laclav\u00edk M, Dlugolinsk\u00fd \u0160, \u0160eleng M, Emails as graph: relation discovery in email archive[C]\/\/Proceedings of the 21st International Conference on World Wide Web. 2012: 841-846."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-015-4515-1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190200313"},{"key":"e_1_3_2_1_6_1","volume-title":"Understanding the complexity of induced subgraph isomorphisms[C]\/\/International Colloquium on Automata, Languages, and Programming","author":"Chen Y","year":"2008","unstructured":"Chen Y, Thurley M, Weyer M. Understanding the complexity of induced subgraph isomorphisms[C]\/\/International Colloquium on Automata, Languages, and Programming. Springer, Berlin, Heidelberg, 2008: 587-596."},{"key":"e_1_3_2_1_7_1","volume-title":"Nirjon S. Subflow: A dynamic induced-subgraph strategy toward real-time dnn inference and training[C]\/\/2020 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)","author":"Lee S","year":"2020","unstructured":"Lee S, Nirjon S. Subflow: A dynamic induced-subgraph strategy toward real-time dnn inference and training[C]\/\/2020 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE, 2020: 15-29."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2914651"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3101057"},{"key":"e_1_3_2_1_10_1","volume-title":"RocksDB: Evolution of Development Priorities in a Key-value Store Serving Large-scale Applications[J]. ACM Transactions on Storage","author":"Dong S","year":"2021","unstructured":"Dong S , Kryczka A , Jin Y , RocksDB: Evolution of Development Priorities in a Key-value Store Serving Large-scale Applications[J]. ACM Transactions on Storage, 2021(17-4)."},{"key":"e_1_3_2_1_11_1","volume-title":"SNAP Datasets: Stanford large network dataset collection[J]","author":"Leskovec J","year":"2014","unstructured":"Leskovec J, Krevl A. SNAP Datasets: Stanford large network dataset collection[J]. 2014. http:\/\/snap.stanford.edu"},{"key":"e_1_3_2_1_12_1","volume-title":"Open graph benchmark: Datasets for machine learning on graphs[J]. Advances in neural information processing systems","author":"Hu W","year":"2020","unstructured":"Hu W, Fey M, Zitnik M, Open graph benchmark: Datasets for machine learning on graphs[J]. Advances in neural information processing systems, 2020, 33: 22118-22133."},{"key":"e_1_3_2_1_13_1","volume-title":"Guo X","author":"Du Y","year":"2021","unstructured":"Du Y, Wang S, Guo X, Graphgt: Machine learning datasets for graph generation and transformation[C].Thirty-fifth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 2). 2021."},{"key":"e_1_3_2_1_14_1","volume-title":"The network data repository with interactive graph analytics and visualization[C].Twenty-ninth AAAI conference on artificial intelligence","author":"Rossi R","year":"2015","unstructured":"Rossi R, Ahmed N. The network data repository with interactive graph analytics and visualization[C].Twenty-ninth AAAI conference on artificial intelligence. 2015."},{"key":"e_1_3_2_1_15_1","volume-title":"Learning to discover social circles in ego networks[J]. Advances in neural information processing systems","author":"Leskovec J","year":"2012","unstructured":"Leskovec J, Mcauley J. Learning to discover social circles in ego networks[J]. Advances in neural information processing systems, 2012, 25."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"volume-title":"Local higher-order graph clustering[C]\/\/Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. 2017: 555-564","author":"Yin H","key":"e_1_3_2_1_17_1","unstructured":"Yin H, Benson A R, Leskovec J, Local higher-order graph clustering[C]\/\/Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining. 2017: 555-564."},{"key":"e_1_3_2_1_18_1","volume-title":"Using triangles to improve community detection in directed networks[J]. arXiv preprint arXiv:1404.5874","author":"Klymko C","year":"2014","unstructured":"Klymko C, Gleich D, Kolda T G. Using triangles to improve community detection in directed networks[J]. arXiv preprint arXiv:1404.5874, 2014."},{"volume-title":"The webgraph framework I: compression techniques[C]\/\/Proceedings of the 13th international conference on World Wide Web. 2004: 595-602","author":"Boldi P","key":"e_1_3_2_1_19_1","unstructured":"Boldi P, Vigna S. The webgraph framework I: compression techniques[C]\/\/Proceedings of the 13th international conference on World Wide Web. 2004: 595-602."},{"key":"e_1_3_2_1_20_1","volume-title":"Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks[J]","author":"Santini P B M R M","year":"2010","unstructured":"Santini P B M R M, Vigna S. Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks[J]. 2010."}],"event":{"name":"ACAI 2022: 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","acronym":"ACAI 2022","location":"Sanya China"},"container-title":["Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579654.3579686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3579654.3579686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:57:22Z","timestamp":1755845842000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579654.3579686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,23]]},"references-count":20,"alternative-id":["10.1145\/3579654.3579686","10.1145\/3579654"],"URL":"https:\/\/doi.org\/10.1145\/3579654.3579686","relation":{},"subject":[],"published":{"date-parts":[[2022,12,23]]},"assertion":[{"value":"2023-03-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}