{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:20:31Z","timestamp":1770229231944,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819561957","type":"print"},{"value":"9789819561964","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-6196-4_4","type":"book-chapter","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T05:59:09Z","timestamp":1770184749000},"page":"49-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Experimental Study of\u00a0Graph Pattern Mining Systems"],"prefix":"10.1007","author":[{"given":"Yi","family":"Ding","sequence":"first","affiliation":[]},{"given":"Yijie","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Wantong","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1772-6863","authenticated-orcid":false,"given":"Zhengyi","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Wenke","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,5]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Chakaravarthy, V.T., et al.: Subgraph counting: color coding beyond trees (2016). https:\/\/arxiv.org\/abs\/1602.04478","DOI":"10.1109\/IPDPS.2016.122"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Chen, X., Dathathri, R., Gill, G., Pingali, K.: Pangolin: an efficient and flexible graph mining system on CPU and GPU. In: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 1\u201313. ACM (2020). https:\/\/doi.org\/10.1145\/3332466.3374543","DOI":"10.1145\/3332466.3374543"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Chon, K.W., Hwang, S.H., Kim, M.S.: GMiner: a fast GPU-based frequent itemset mining method for large-scale data. Inf. Sci. 439\u2013440, 19\u201338 (2018). https:\/\/doi.org\/10.1016\/j.ins.2018.01.046, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025518300690","DOI":"10.1016\/j.ins.2018.01.046"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Ding, Y., Lin, H., Yang, Z., Wen, D., Wang, X., Zhang, W.: An experimental comparison of RDF systems on cloud. In: Australasian Database Conference, pp. 30\u201343. Springer, Singapore (2024)","DOI":"10.1007\/978-981-96-1242-0_3"},{"key":"4_CR5","unstructured":"Gonzalez, J.E., Xin, R.S., Dave, A., Crankshaw, D., Franklin, M.J., Stoica, I.: GraphX: graph processing in a distributed dataflow framework. In: Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp. 599\u2013613. USENIX Association (2014)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Hao, K., Yang, Z., Lai, L., Lai, Z., Jin, X., Lin, X.: PatMat: a distributed pattern matching engine with cypher. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp. 2921\u20132924 (2019)","DOI":"10.1145\/3357384.3357840"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Hu, L., Zou, L.: A GPU-based graph pattern mining system. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3511808.3557192","DOI":"10.1145\/3511808.3557192"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Jamshidi, K., Mahadasa, R., Vora, K.: Peregrine: a pattern-aware graph mining system. In: Proceedings of the Fifteenth European Conference on Computer Systems (EuroSys), pp. 1\u201316. ACM (2020). https:\/\/doi.org\/10.1145\/3342195.3387548","DOI":"10.1145\/3342195.3387548"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Jin, X., Yang, Z., Lin, X., Yang, S., Qin, L., Peng, Y.: FAST: FPGA-based subgraph matching on massive graphs. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 1452\u20131463. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00129"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. 16, 1038\u20131051 (2004). https:\/\/doi.org\/10.1109\/TKDE.2004.33","DOI":"10.1109\/TKDE.2004.33"},{"issue":"10","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.14778\/3339490.3339494","volume":"12","author":"L Lai","year":"2019","unstructured":"Lai, L., et al.: Distributed subgraph matching on timely dataflow. Proc. VLDB Endowment 12(10), 1099\u20131112 (2019)","journal-title":"Proc. VLDB Endowment"},{"issue":"1\u20133","key":"4_CR12","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoret. Comput. Sci. 407(1\u20133), 458\u2013473 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Luo, Q., et al.: Hierarchical structure construction on hypergraphs. In: Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, pp. 1597\u20131606 (2024)","DOI":"10.1145\/3627673.3679765"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 135\u2013146. ACM (2010). https:\/\/doi.org\/10.1145\/1807167.1807184","DOI":"10.1145\/1807167.1807184"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Mawhirter, D., Wu, B.: AutoMine: harmonizing high-level abstraction and high performance for graph mining. Association for Computing Machinery (2019)","DOI":"10.1145\/3341301.3359633"},{"key":"4_CR16","unstructured":"Microsoft: MICO: Microsoft membership inference competition. https:\/\/github.com\/microsoft\/mico gitHub repository (2022). Accessed 04 Sep 2025"},{"issue":"5594","key":"4_CR17","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Ramos, R.H., de Oliveira Lage Ferreira, C., Simao, A.: Human protein\u2013protein interaction networks: a topological comparison review. Heliyon 10(5), e27278 (2024). https:\/\/doi.org\/10.1016\/j.heliyon.2024.e27278, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2405844024033097","DOI":"10.1016\/j.heliyon.2024.e27278"},{"key":"4_CR19","unstructured":"Scott, J.: What is Social Network Analysis? \u2018What is?\u2019 Research Methods Series. Bloomsbury Academic, London and New York (2012). https:\/\/library.oapen.org\/bitstream\/handle\/20.500.12657\/58730\/9781849668200.pdf. open access under CC BY-NC 3.0. Accessed 24 Sep 2025"},{"key":"4_CR20","unstructured":"Social Computing Data Repository, Syracuse University: Twitter social network dataset. https:\/\/datasets.syr.edu\/datasets\/Twitter.html (nd). https:\/\/datasets.syr.edu\/datasets\/Twitter.html, 11,316,811 nodes; 85,331,846 edges; retrieved [access-date]"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Teixeira, C.H.C., Fonseca, A.J., Serafini, M., Siganos, G., Zaki, M.J., Aboulnaga, A.: Arabesque: a system for distributed graph mining. In: Proceedings of the 25th Symposium on Operating Systems Principles, pp. 425\u2013440. ACM (2015). https:\/\/doi.org\/10.1145\/2815400.2815410","DOI":"10.1145\/2815400.2815410"},{"key":"4_CR22","unstructured":"University of Maryland Department of Computer Science: Featured research projects. https:\/\/www.cs.umd.edu\/research\/projects (2025). Accessed 04 Sep 2025"},{"key":"4_CR23","unstructured":"Wang, K., Zuo, Z., Thorpe, J., Nguyen, T.Q., Xu, G.H.: RStream: marrying relational algebra with streaming for efficient graph mining on a single machine. In: Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp. 763\u2013782. USENIX Association (2018)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Wang, R., Yang, Z., Zhang, W., Lin, X.: An empirical study on recent graph database systems. In: International Conference on Knowledge Science, Engineering and Management, pp. 328\u2013340. Springer International Publishing Cham (2020)","DOI":"10.1007\/978-3-030-55130-8_29"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. In: Proceedings of the 2012 IEEE International Conference on Data Mining (ICDM), pp. 745\u2013754. IEEE (2012). https:\/\/arxiv.org\/pdf\/1205.6233","DOI":"10.1109\/ICDM.2012.138"},{"key":"4_CR26","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":"4_CR27","doi-asserted-by":"crossref","unstructured":"Yang, Z., Zhang, W., Lin, X., Zhang, Y., Li, S.: HGMatch: a match-by-hyperedge approach for subgraph matching on hypergraphs. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 2063\u20132076. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00160"},{"key":"4_CR28","unstructured":"Yin, H., Benson, A.R., Leskovec, J.: Patterns and pattern matching in dynamic graphs. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 941\u2013950. ACM (2016)"},{"key":"4_CR29","unstructured":"Zafarani, R., Liu, H.: Social computing data repository at ASU (2009)"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Zhang, W., Yang, Z., Wen, D., Li, W., Zhang, W., Lin, X.: Accelerating core decomposition in billion-scale hypergraphs 3(1) (2025). https:\/\/doi.org\/10.1145\/3709656","DOI":"10.1145\/3709656"},{"key":"4_CR31","unstructured":"Zhu, Z., Wu, K., Liu, Z.: Arya: Arbitrary graph pattern mining with decomposition-based sampling. In: 20th USENIX Symposium on Networked Systems Design and Implementation (NSDI 23), pp. 1013\u20131030. USENIX Association, Boston, MA (2023). https:\/\/www.usenix.org\/conference\/nsdi23\/presentation\/zhu"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-6196-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T05:59:17Z","timestamp":1770184757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6196-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819561957","9789819561964"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6196-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"5 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc-conference.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}