{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T12:13:37Z","timestamp":1769775217815,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819556397","type":"print"},{"value":"9789819556403","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-5640-3_40","type":"book-chapter","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:07:39Z","timestamp":1769720859000},"page":"631-647","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Speeding up\u00a0FaSTest: Parallel Cardinality Estimation of\u00a0Subgraph Matching"],"prefix":"10.1007","author":[{"given":"Maoyin","family":"Ran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyi","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8123-9018","authenticated-orcid":false,"given":"Zhaokang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,30]]},"reference":[{"issue":"4","key":"40_CR1","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/110859440","volume":"42","author":"A Atserias","year":"2013","unstructured":"Atserias, A., Grohe, M., Marx, D.: Size bounds and query plans for relational joins. SIAM J. Comput. 42(4), 1737\u20131767 (2013). https:\/\/doi.org\/10.1137\/110859440","journal-title":"SIAM J. Comput."},{"key":"40_CR2","doi-asserted-by":"publisher","unstructured":"Bhattarai, B., Liu, H., Huang, H.H.: CECI: compact embedding cluster index for scalable subgraph matching. In: Boncz, P.A., Manegold, S., Ailamaki, A., Deshpande, A., Kraska, T. (eds.) Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019, Amsterdam, The Netherlands, 30 June - 5 July 2019, pp. 1447\u20131462. ACM (2019). https:\/\/doi.org\/10.1145\/3299869.3300086","DOI":"10.1145\/3299869.3300086"},{"key":"40_CR3","doi-asserted-by":"publisher","unstructured":"Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: \u00d6zcan, F., Koutrika, G., Madden, S. (eds.) Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, 26 June - 01 July 2016, pp. 1199\u20131214. ACM (2016). https:\/\/doi.org\/10.1145\/2882903.2915236","DOI":"10.1145\/2882903.2915236"},{"issue":"1","key":"40_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TCBB.2016.2515595","volume":"14","author":"V Bonnici","year":"2017","unstructured":"Bonnici, V., Giugno, R.: On the variable ordering in subgraph isomorphism algorithms. IEEE ACM Trans. Comput. Biol. Bioinform. 14(1), 193\u2013203 (2017). https:\/\/doi.org\/10.1109\/TCBB.2016.2515595","journal-title":"IEEE ACM Trans. Comput. Biol. Bioinform."},{"key":"40_CR5","doi-asserted-by":"publisher","unstructured":"Burkhardt, P., Harris, D.G.: Simple and efficient four-cycle counting on sparse graphs (2023). https:\/\/doi.org\/10.48550\/ARXIV.2303.06090","DOI":"10.48550\/ARXIV.2303.06090"},{"key":"40_CR6","doi-asserted-by":"publisher","unstructured":"Han, M., Kim, H., Gu, G., Park, K., Han, W.: Efficient subgraph matching: Harmonizing dynamic programming, adaptive matching order, and failing set together. In: Boncz, P.A., Manegold, S., Ailamaki, A., Deshpande, A., Kraska, T. (eds.) Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019, Amsterdam, The Netherlands, 30 June - 5 July 2019, pp. 1429\u20131446. ACM (2019). https:\/\/doi.org\/10.1145\/3299869.3319880","DOI":"10.1145\/3299869.3319880"},{"key":"40_CR7","doi-asserted-by":"publisher","unstructured":"Han, W., Lee, J., Lee, J.: Turbo$$ _{\\text{iso}}$$: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Ross, K.A., Srivastava, D., Papadias, D. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, New York, USA, 22-27 June 2013, pp. 337\u2013348. ACM (2013). https:\/\/doi.org\/10.1145\/2463676.2465300","DOI":"10.1145\/2463676.2465300"},{"issue":"2","key":"40_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/S00778-022-00749-X","volume":"32","author":"H Kim","year":"2023","unstructured":"Kim, H., Choi, Y., Park, K., Lin, X., Hong, S., Han, W.: Fast subgraph query processing and subgraph matching via static and dynamic equivalences. VLDB J. 32(2), 343\u2013368 (2023). https:\/\/doi.org\/10.1007\/S00778-022-00749-X","journal-title":"VLDB J."},{"key":"40_CR9","doi-asserted-by":"publisher","unstructured":"Kim, K., Kim, H., Fletcher, G., Han, W.: Combining sampling and synopses with worst-case optimal runtime and quality guarantees for graph pattern cardinality estimation. In: Li, G., Li, Z., Idreos, S., Srivastava, D. (eds.) SIGMOD 2021: International Conference on Management of Data, Virtual Event, China, 20-25 June 2021, pp. 964\u2013976. ACM (2021). https:\/\/doi.org\/10.1145\/3448016.3457246","DOI":"10.1145\/3448016.3457246"},{"key":"40_CR10","doi-asserted-by":"publisher","unstructured":"Lai, L., Qin, L., Lin, X., Zhang, Y., Chang, L.: Scalable distributed subgraph enumeration. Proc. VLDB Endow. 10(3), 217\u2013228 (2016). https:\/\/doi.org\/10.14778\/3021924.3021937","DOI":"10.14778\/3021924.3021937"},{"key":"40_CR11","doi-asserted-by":"publisher","unstructured":"Lai, L., et al.: Distributed subgraph matching on timely dataflow. Proc. VLDB Endow. 12(10), 1099\u20131112 (2019). https:\/\/doi.org\/10.14778\/3339490.3339494","DOI":"10.14778\/3339490.3339494"},{"key":"40_CR12","unstructured":"Lai, L., et al.: Glogs: Interactive graph pattern matching query at large scale. In: Lawall, J., Williams, D. (eds.) Proceedings of the 2023 USENIX Annual Technical Conference, USENIX ATC 2023, Boston, MA, USA, 10-12 July 2023, pp. 53\u201369. USENIX Association (2023)"},{"key":"40_CR13","doi-asserted-by":"publisher","unstructured":"Neumann, T., Moerkotte, G.: Characteristic sets: accurate cardinality estimation for RDF queries with multiple joins. In: Abiteboul, S., B\u00f6hm, K., Koch, C., Tan, K. (eds.) Proceedings of the 27th International Conference on Data Engineering, ICDE 2011, 11-16 April 2011, Hannover, Germany. pp. 984\u2013994. IEEE Computer Society (2011). https:\/\/doi.org\/10.1109\/ICDE.2011.5767868","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"40_CR14","doi-asserted-by":"publisher","unstructured":"Park, Y., Ko, S., Bhowmick, S.S., Kim, K., Hong, K., Han, W.: G-CARE: a framework for performance benchmarking of cardinality estimation techniques for subgraph matching. In: Maier, D., Pottinger, R., Doan, A., Tan, W., Alawini, A., Ngo, H.Q. (eds.) Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, online conference [Portland, OR, USA], 14-19 June 2020, pp. 1099\u20131114. ACM (2020). https:\/\/doi.org\/10.1145\/3318464.3389702","DOI":"10.1145\/3318464.3389702"},{"key":"40_CR15","doi-asserted-by":"publisher","unstructured":"Shin, W., Song, S., Park, K., Han, W.: Cardinality estimation of subgraph matching: A filtering-sampling approach. Proc. VLDB Endow. 17(7), 1697\u20131709 (2024). https:\/\/doi.org\/10.14778\/3654621.3654635","DOI":"10.14778\/3654621.3654635"},{"key":"40_CR16","doi-asserted-by":"publisher","unstructured":"Stefanoni, G., Motik, B., Kostylev, E.V.: Estimating the cardinality of conjunctive queries over RDF data using graph summarisation. In: Champin, P., Gandon, F., Lalmas, M., Ipeirotis, P.G. (eds.) Proceedings of the 2018 World Wide Web Conference on World Wide Web, WWW 2018, Lyon, France, 23-27 April 2018, pp. 1043\u20131052. ACM (2018). https:\/\/doi.org\/10.1145\/3178876.3186003","DOI":"10.1145\/3178876.3186003"},{"key":"40_CR17","doi-asserted-by":"publisher","unstructured":"Sun, S., Luo, Q.: In-memory subgraph matching: an in-depth study. In: Maier, D., Pottinger, R., Doan, A., Tan, W., Alawini, A., Ngo, H.Q. (eds.) Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, Online Conference, Portland, OR, USA, 14-19 June 2020. pp. 1083\u20131098. ACM (2020). https:\/\/doi.org\/10.1145\/3318464.3380581","DOI":"10.1145\/3318464.3380581"},{"issue":"1","key":"40_CR18","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TKDE.2020.2980257","volume":"34","author":"S Sun","year":"2022","unstructured":"Sun, S., Luo, Q.: Subgraph matching with effective matching order and indexing. IEEE Trans. Knowl. Data Eng. 34(1), 491\u2013505 (2022). https:\/\/doi.org\/10.1109\/TKDE.2020.2980257","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"40_CR19","doi-asserted-by":"publisher","unstructured":"Sun, S., Sun, X., Che, Y., Luo, Q., He, B.: Rapidmatch: a holistic approach to subgraph query processing. Proc. VLDB Endow. 14(2), 176\u2013188 (2020). https:\/\/doi.org\/10.14778\/3425879.3425888","DOI":"10.14778\/3425879.3425888"},{"key":"40_CR20","doi-asserted-by":"publisher","unstructured":"Wang, H., Hu, R., Zhang, Y., Qin, L., Wang, W., Zhang, W.: Neural subgraph counting with wasserstein estimator. In: Ives, Z.G., Bonifati, A., Abbadi, A.E. (eds.) SIGMOD 2022: International Conference on Management of Data, Philadelphia, PA, USA, 12 - 17 June 2022. pp. 160\u2013175. ACM (2022). https:\/\/doi.org\/10.1145\/3514221.3526163","DOI":"10.1145\/3514221.3526163"},{"issue":"2","key":"40_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/S00778-022-00746-0","volume":"32","author":"K Wang","year":"2023","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Accelerated butterfly counting with vertex priority on bipartite graphs. VLDB J. 32(2), 257\u2013281 (2023). https:\/\/doi.org\/10.1007\/S00778-022-00746-0","journal-title":"VLDB J."},{"issue":"12","key":"40_CR22","doi-asserted-by":"publisher","first-page":"2953","DOI":"10.1109\/TPDS.2021.3076246","volume":"32","author":"Z Wang","year":"2021","unstructured":"Wang, Z., Hu, W., Chen, G., Yuan, C., Gu, R., Huang, Y.: Towards efficient distributed subgraph enumeration via backtracking-based framework. IEEE Trans. Parallel Distributed Syst. 32(12), 2953\u20132969 (2021). https:\/\/doi.org\/10.1109\/TPDS.2021.3076246","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"40_CR23","doi-asserted-by":"publisher","unstructured":"Yang, Z., Lai, L., Lin, X., Hao, K., Zhang, W.: HUGE: an efficient and scalable subgraph enumeration system. In: Li, G., Li, Z., Idreos, S., Srivastava, D. (eds.) SIGMOD \u201921: International Conference on Management of Data, Virtual Event, China, 20-25 June 2021, pp. 2049\u20132062. ACM (2021). https:\/\/doi.org\/10.1145\/3448016.3457237","DOI":"10.1145\/3448016.3457237"},{"key":"40_CR24","doi-asserted-by":"publisher","unstructured":"Zhao, K., Yu, J.X., Zhang, H., Li, Q., Rong, Y.: A learned sketch for subgraph counting. In: Li, G., Li, Z., Idreos, S., Srivastava, D. (eds.) SIGMOD 2021: International Conference on Management of Data, Virtual Event, China,20-25 June 2021. pp. 2142\u20132155. ACM (2021). https:\/\/doi.org\/10.1145\/3448016.3457289","DOI":"10.1145\/3448016.3457289"},{"key":"40_CR25","doi-asserted-by":"publisher","unstructured":"Zhao, Z., Christensen, R., Li, F., Hu, X., Yi, K.: Random sampling over joins revisited. In: Das, G., Jermaine, C.M., Bernstein, P.A. (eds.) Proceedings of the 2018 International Conference on Management of Data, SIGMOD Conference 2018, Houston, TX, USA, 10-15 June 2018, pp. 1525\u20131539. ACM (2018). https:\/\/doi.org\/10.1145\/3183713.3183739","DOI":"10.1145\/3183713.3183739"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5640-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:07:41Z","timestamp":1769720861000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5640-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819556397","9789819556403"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5640-3_40","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":"30 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"28 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2025.sau.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}