{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:11:01Z","timestamp":1742976661183,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466762"},{"type":"electronic","value":"9783031466779"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-46677-9_6","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"77-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cardinality Estimation of\u00a0Subgraph Search Queries with\u00a0Direction Learner"],"prefix":"10.1007","author":[{"given":"Wenzhe","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: SIGMOD, pp. 1199\u20131214 (2016)","DOI":"10.1145\/2882903.2915236"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/TPAMI.2017.2696940","volume":"40","author":"V Carletti","year":"2018","unstructured":"Carletti, V., Foggia, P., Saggese, A., Vento, M.: Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3. TPAMI 40(4), 804\u2013818 (2018)","journal-title":"TPAMI"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"2627","DOI":"10.1016\/S1352-2310(97)00447-0","volume":"32","author":"M Gardner","year":"1998","unstructured":"Gardner, M., Dorling, S.: Artificial neural networks (the multilayer perceptron) - a review of applications in the atmospheric sciences. Atmos. Environ. 32, 2627\u20132636 (1998)","journal-title":"Atmos. Environ."},{"key":"6_CR4","unstructured":"Hamilton, W.L., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NIPS, pp. 1024\u20131034 (2017)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Han, M., Kim, H., Gu, G., Park, K., Han, W.S.: Efficient subgraph matching: harmonizing dynamic programming, adaptive matching order, and failing set together. In: SIGMOD, pp. 1429\u20131446 (2019)","DOI":"10.1145\/3299869.3319880"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: SIGMOD, pp. 405\u2013418 (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"6_CR7","unstructured":"Kipf, T., Welling, M.: Semi-supervised classification with graph convolutional networks. ArXiv abs\/1609.02907 (2017)"},{"key":"6_CR8","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, 24\u201326 April 2017, Conference Track Proceedings (2017). https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3284551","volume":"44","author":"F Li","year":"2019","unstructured":"Li, F., Wu, B., Yi, K., Zhao, Z.: Wander join and XDB: online aggregation via random walks. ACM Trans. Database Syst. 44(1), 1\u201341 (2019)","journal-title":"ACM Trans. Database Syst."},{"issue":"11","key":"6_CR10","first-page":"2019","volume":"43","author":"G Li","year":"2020","unstructured":"Li, G., et al.: A survey of machine learning based database techniques. Chinese J. Comput. 43(11), 2019\u20132049 (2020)","journal-title":"Chinese J. Comput."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Li, Q., Han, Z., Wu, X.M.: Deeper insights into graph convolutional networks for semi-supervised learning. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, AAAI 2018\/IAAI 2018\/EAAI 2018 (2018)","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"6_CR12","first-page":"1792","volume":"29","author":"R Li","year":"2018","unstructured":"Li, R., Hong, L.: Method for subgraph matching with inclusion degree. J. Softw. 29, 1792\u20131812 (2018)","journal-title":"J. Softw."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Liu, X., Pan, H., He, M., Song, Y., Jiang, X., Shang, L.: Neural subgraph isomorphism counting. In: KDD 2020, pp. 1959\u20131969 (2020)","DOI":"10.1145\/3394486.3403247"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Liu, X., Song, Y.: Graph convolutional networks with dual message passing for subgraph isomorphism counting and matching. In: AAAI, vol. 36, pp. 7594\u20137602 (2022)","DOI":"10.1609\/aaai.v36i7.20725"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Neumann, T., Moerkotte, G.: Characteristic sets: accurate cardinality estimation for RDF queries with multiple joins. In: Proceedings of the 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011, pp. 984\u2013994 (2011)","DOI":"10.1109\/ICDE.2011.5767868"},{"issue":"10","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-319-41576-5_14","volume-title":"Biomedical Data Management and Graph Online Querying","author":"M Paradies","year":"2016","unstructured":"Paradies, M., Vasilyeva, E., Mocan, A., Lehner, W.: Robust cardinality estimation for subgraph isomorphism queries on property graphs. In: Wang, F., Luo, G., Weng, C., Khan, A., Mitra, P., Yu, C. (eds.) Big-O(Q)\/DMAH 2015. LNCS, vol. 9579, pp. 184\u2013198. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41576-5_14"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Park, Y., Ko, S., Bhowmick, S.S., Kim, K., Hong, K., Han, W.S.: G-care: a framework for performance benchmarking of cardinality estimation techniques for subgraph matching. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, SIGMOD 2020, pp. 1099\u20131114 (2020)","DOI":"10.1145\/3318464.3389702"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2009","unstructured":"Scarselli, F., Gori, M., Tsoi, A.C., Hagenbuchner, M., Monfardini, G.: The graph neural network model. IEEE Trans. Neural Netw. 20, 61\u201380 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Stocker, M., Seaborne, A., Bernstein, A., Kiefer, C., Reynolds, D.: SPARQL basic graph pattern optimization using selectivity estimation. In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, pp. 595\u2013604 (2008)","DOI":"10.1145\/1367497.1367578"},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Wang, H., Hu, R., Zhang, Y., Qin, L., Wang, W., Zhang, W.: Neural subgraph counting with Wasserstein estimator. In: SIGMOD, pp. 160\u2013175 (2022)","DOI":"10.1145\/3514221.3526163"},{"key":"6_CR23","unstructured":"Weisfeiler, B., Leman, A.: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia 9 (1968). (in Russian)"},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2021","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Yu, P.S.: A comprehensive survey on graph neural networks. IEEE Trans. Neural Networks Learn. Syst. 32(1), 4\u201324 (2021)","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"key":"6_CR25","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: ICLR. OpenReview.net (2019)"},{"key":"6_CR26","unstructured":"Zaheer, M., Kottur, S., Ravanbhakhsh, S., P\u00f3czos, B., Salakhutdinov, R., Smola, A.J.: Deep sets. In: NIPS, pp. 3394\u20133404. Curran Associates Inc., Red Hook (2017)"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Zhao, K., Yu, J.X., Zhang, H., Li, Q., Rong, Y.: A learned sketch for subgraph counting. In: SIGMOD, pp. 2142\u20132155 (2021)","DOI":"10.1145\/3448016.3457289"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46677-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:22:09Z","timestamp":1699104129000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46677-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466762","9783031466779"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46677-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","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":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes. Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"503","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"216","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.97","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.77","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}