{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:26:58Z","timestamp":1786980418140,"version":"build-2736575974"},"reference-count":121,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T00:00:00Z","timestamp":1675900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T00:00:00Z","timestamp":1675900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["No. 14203618, No. 14202919 and No. 14205520"],"award-info":[{"award-number":["No. 14203618, No. 14202919 and No. 14205520"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s00778-023-00781-5","type":"journal-article","created":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T19:00:00Z","timestamp":1675969200000},"page":"937-962","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Learned sketch for subgraph counting: a holistic approach"],"prefix":"10.1007","volume":"32","author":[{"given":"Kangfei","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9738-827X","authenticated-orcid":false,"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiyan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Rong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,9]]},"reference":[{"key":"781_CR1","doi-asserted-by":"crossref","unstructured":"Aberger, C.R., Tu, S., Olukotun, K., R\u00e9, C.: Old techniques for new join algorithms: a case study in rdf processing. In: 2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW), pp. 97\u2013102. IEEE, (2016)","DOI":"10.1109\/ICDEW.2016.7495625"},{"issue":"4","key":"781_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/3129246","volume":"42","author":"CR Aberger","year":"2017","unstructured":"Aberger, C.R., Lamb, A., Tu, S., N\u00f6tzli, A., Olukotun, K., R\u00e9, C.: EmptyHeaded: a relational engine for graph processing. ACM Trans. Database Syst. 42(4), 44 (2017)","journal-title":"ACM Trans. Database Syst."},{"key":"781_CR3","unstructured":"Aggarwal, C.C., Kong, X., Gu, Q., Han, J., Yu, P.\u00a0S.: Active learning: a survey. In: Data Classification: Algorithms and Applications, pp. 571\u2013606 (2014)"},{"key":"781_CR4","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Neville, J., Rossi, R.A., Duffield, N.G.: Efficient graphlet counting for large networks. In: Proceedings ICDM\u201915, pp. 1\u201310 (2015)","DOI":"10.1109\/ICDM.2015.141"},{"issue":"3","key":"781_CR5","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10115-016-0965-5","volume":"50","author":"NK Ahmed","year":"2017","unstructured":"Ahmed, N.K., Neville, J., Rossi, R.A., Duffield, N.G., Willke, T.L.: Graphlet decomposition: framework, algorithms, and applications. Knowl. Inf. Syst. 50(3), 689\u2013722 (2017)","journal-title":"Knowl. Inf. Syst."},{"key":"781_CR6","doi-asserted-by":"crossref","unstructured":"Ammar, K., McSherry, F., Salihoglu, S., Joglekar, M.: Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows. Proc. VLDB, 11(6), (2018)","DOI":"10.14778\/3184470.3184473"},{"key":"781_CR7","doi-asserted-by":"crossref","unstructured":"Archibald, B., Dunlop, F., Hoffmann, R., McCreesh, C., Prosser, P., Trimble, J.: Sequential and parallel solution-biased search for subgraph algorithms. In: Proc. CPAIOR\u201919, pp. 20\u201338, (2019)","DOI":"10.1007\/978-3-030-19212-9_2"},{"key":"781_CR8","doi-asserted-by":"crossref","unstructured":"Atserias, A., Grohe, M., Marx, D.: Size bounds and query plans for relational joins. In: Proceedings of FOCS\u201908, pp. 739\u2013748, (2008)","DOI":"10.1109\/FOCS.2008.43"},{"key":"781_CR9","unstructured":"Battaglia, P.W., et al.: Relational inductive biases, deep learning, and graph networks. CoRR, abs\/1806.01261, (2018)"},{"key":"781_CR10","doi-asserted-by":"crossref","unstructured":"Bhattarai, B., Liu, H., Huang, H.H.: CECI: compact embedding cluster index for scalable subgraph matching. In: Proc. SIGMOD\u201919, pp. 1447\u20131462, (2019)","DOI":"10.1145\/3299869.3300086"},{"key":"781_CR11","doi-asserted-by":"crossref","unstructured":"Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: Proc. SIGMOD\u201916, pp. 1199\u20131214, (2016)","DOI":"10.1145\/2882903.2915236"},{"key":"781_CR12","unstructured":"Bodirsky, M.: Graph homomorphisms and universal algebra course notes. (2015)"},{"issue":"S\u20137","key":"781_CR13","doi-asserted-by":"publisher","first-page":"S13","DOI":"10.1186\/1471-2105-14-S7-S13","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D.E., Ferro, A.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform. 14(S\u20137), S13 (2013)","journal-title":"BMC Bioinform."},{"key":"781_CR14","doi-asserted-by":"publisher","first-page":"i47","DOI":"10.1093\/bioinformatics\/bti1007","volume":"21","author":"KM Borgwardt","year":"2005","unstructured":"Borgwardt, K.M., et al.: Protein function prediction via graph kernels. Bioinformatics 21, i47\u2013i56 (2005)","journal-title":"Bioinformatics"},{"key":"781_CR15","doi-asserted-by":"crossref","unstructured":"Bressan, M., Chierichetti, F., Kumar, R., Leucci, S., Panconesi, A.: Counting graphlets: space vs time. In: Proc. WSDM\u201917, pp. 557\u2013566, (2017)","DOI":"10.1145\/3018661.3018732"},{"issue":"4","key":"781_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186586","volume":"12","author":"M Bressan","year":"2018","unstructured":"Bressan, M., Chierichetti, F., Kumar, R., Leucci, S., Panconesi, A.: Motif counting beyond five nodes. ACM Trans. Knowl. Discov. Data 12(4), 1\u201325 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"11","key":"781_CR17","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.14778\/3342263.3342640","volume":"12","author":"M Bressan","year":"2019","unstructured":"Bressan, M., Leucci, S., Panconesi, A.: Motivo: fast motif counting via succinct color coding and adaptive sampling. Proc. VLDB 12(11), 1651\u20131663 (2019)","journal-title":"Proc. VLDB"},{"key":"781_CR18","doi-asserted-by":"crossref","unstructured":"Cai, W., Balazinska, M., Suciu, D.: Pessimistic cardinality estimation: Tighter upper bounds for intermediate join cardinalities. In: Proceedings SIGMOD\u201919, pp. 18\u201335, (2019)","DOI":"10.1145\/3299869.3319894"},{"key":"781_CR19","doi-asserted-by":"crossref","unstructured":"Cai, W., Zhang, Y., Zhou, J.: Maximizing expected model change for active learning in regression. In: Proceedings ICDM\u201913, pp. 51\u201360, (2013)","DOI":"10.1109\/ICDM.2013.104"},{"key":"781_CR20","unstructured":"Chen, Z., Chen, L., Villar, S., Bruna, J.: Can graph neural networks count substructures? In: NeurIPS\u201920, (2020)"},{"key":"781_CR21","doi-asserted-by":"crossref","unstructured":"Chen, X., Lui, J.\u00a0C.\u00a0S.: Mining graphlet counts in online social networks. In: Proceedings ICDM\u201916, pp. 71\u201380, (2016)","DOI":"10.1109\/ICDM.2016.0018"},{"key":"781_CR22","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, May 3\u20135, 1971, Shaker Heights, Ohio, USA, pp. 151\u2013158, (1971)"},{"issue":"9","key":"781_CR23","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.14778\/3329772.3329780","volume":"12","author":"A Dutt","year":"2019","unstructured":"Dutt, A., Wang, C., Nazi, A., Kandula, S., Narasayya, V.R., Chaudhuri, S.: Selectivity estimation for range predicates using lightweight models. Proc. VLDB 12(9), 1044\u20131057 (2019)","journal-title":"Proc. VLDB"},{"issue":"12","key":"781_CR24","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.14778\/3407790.3407820","volume":"13","author":"A Dutt","year":"2020","unstructured":"Dutt, A., Wang, C., Narasayya, V., Chaudhuri, S.: Efficiently approximating selectivity functions using low overhead regression models. Proc. VLDB Endow. 13(12), 2215\u20132228 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"781_CR25","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Greco, G., Leone, N., Scarcello, F.: Hypertree decompositions: questions and answers. In: Proceedings of PODS\u201916, pp. 57\u201374, (2016)","DOI":"10.1145\/2902251.2902309"},{"key":"781_CR26","doi-asserted-by":"crossref","unstructured":"Grover,A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: Proceedings of KDD\u201916, pp. 855\u2013864, (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"781_CR27","unstructured":"Hamilton, W.L., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Proc. NeurIPS\u201917, pp. 1024\u20131034, (2017)"},{"key":"781_CR28","doi-asserted-by":"crossref","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: Proceedings SIGMOD\u201919, pp. 1429\u20131446, (2019)","DOI":"10.1145\/3299869.3319880"},{"key":"781_CR29","unstructured":"Hanneke, S.: A statistical theory of active learning. In: Foundations and Trends in Machine Learning, pp. 1\u2013212, (2013)"},{"key":"781_CR30","doi-asserted-by":"crossref","unstructured":"Harchaoui, Z., Bach, F.R.: Image classification with segmentation graph kernels. In: Proceedings CVPR\u201907, (2007)","DOI":"10.1109\/CVPR.2007.383049"},{"key":"781_CR31","doi-asserted-by":"crossref","unstructured":"Hasan, S., et al.: Deep learning models for selectivity estimation of multi-attribute queries. In: Proceedings SIGMOD\u201920, pp. 1035\u20131050, (2020)","DOI":"10.1145\/3318464.3389741"},{"key":"781_CR32","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In Proceedings ACM SIGMOD\u201908, (2008)","DOI":"10.1145\/1376616.1376660"},{"issue":"7","key":"781_CR33","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/3384345.3384349","volume":"13","author":"B Hilprecht","year":"2020","unstructured":"Hilprecht, B., Schmidt, A., Kulessa, M., Molina, A., Kersting, K., Binnig, C.: Deepdb: Learn from data, not from queries! Proc. VLDB 13(7), 992\u20131005 (2020)","journal-title":"Proc. VLDB"},{"key":"781_CR34","unstructured":"Hocevar, T., Demsar, J.: Combinatorial algorithm for counting small induced graphs and orbits. CoRR, abs\/1601.06834, (2016)"},{"issue":"2","key":"781_CR35","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","volume":"4","author":"K Hornik","year":"1991","unstructured":"Hornik, K.: Approximation capabilities of multilayer feedforward networks. Neural Netw. 4(2), 251\u2013257 (1991)","journal-title":"Neural Netw."},{"issue":"5","key":"781_CR36","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K Hornik","year":"1989","unstructured":"Hornik, K., Stinchcombe, M.B., White, H.: Multilayer feedforward networks are universal approximators. Neural Netw. 2(5), 359\u2013366 (1989)","journal-title":"Neural Netw."},{"issue":"260","key":"781_CR37","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1080\/01621459.1952.10483446","volume":"47","author":"DG Horvitz","year":"1952","unstructured":"Horvitz, D.G., Thompson, D.J.: A generalization of sampling without replacement from a finite universe. J. Am. Stat. Assoc. 47(260), 663\u2013685 (1952)","journal-title":"J. Am. Stat. Assoc."},{"key":"781_CR38","unstructured":"https:\/\/github.com\/RapidsAtHKUST\/SubgraphMatching"},{"key":"781_CR39","unstructured":"https:\/\/github.com\/yspark-dblab\/gcare"},{"key":"781_CR40","doi-asserted-by":"crossref","unstructured":"Jain, S., et\u00a0al.: Impact of memory space optimization technique on fast network motif search algorithm. In: Advances in Computer and Computational Sciences, pp. 559\u2013567. Springer, (2017)","DOI":"10.1007\/978-981-10-3770-2_52"},{"key":"781_CR41","doi-asserted-by":"crossref","unstructured":"Jha, M., et al.: Path sampling: a fast and provable method for estimating 4-vertex subgraph counts. In: Proc. WWW\u201915, pp. 495\u2013505, (2015)","DOI":"10.1145\/2736277.2741101"},{"key":"781_CR42","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.dam.2018.02.018","volume":"242","author":"A J\u00fcttner","year":"2018","unstructured":"J\u00fcttner, A., Madarasi, P.: VF2++ - an improved subgraph isomorphism algorithm. Discret. Appl. Math. 242, 69\u201381 (2018)","journal-title":"Discret. Appl. Math."},{"key":"781_CR43","unstructured":"Khamis, M.A., Ngo, H.Q., Suciu, D.: What do shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? In: Proceedings PODS\u201917, pp. 429\u2013444, (2017)"},{"issue":"13","key":"781_CR44","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.14778\/3151106.3151112","volume":"10","author":"M Kiefer","year":"2017","unstructured":"Kiefer, M., Heimel, M., Bre\u00df, S., Markl, V.: Estimating join selectivities using bandwidth-optimized kernel density models. Proc. VLDB 10(13), 2085\u20132096 (2017)","journal-title":"Proc. VLDB"},{"key":"781_CR45","unstructured":"Kipf, A., et al.: Learned cardinalities: estimating correlated joins with deep learning. In: Proc. CIDR\u201919, (2019)"},{"key":"781_CR46","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: Proc. ICLR\u201917, (2017)"},{"key":"781_CR47","doi-asserted-by":"crossref","unstructured":"Kolda, T.G., Pinar, A., Seshadhri, C.: Triadic measures on graphs: the power of wedge sampling. In: Proc. ICDM\u201913, pp. 10\u201318, (2013)","DOI":"10.1137\/1.9781611972832.2"},{"key":"781_CR48","unstructured":"Krogh, A., and Vedelsby, J.: Neural network ensembles, cross validation, and active learning. In: Proceedings NIPS\u201994, pp. 231\u2013238, (1994)"},{"key":"781_CR49","unstructured":"Lakshminarayanan, B., et al.: Simple and scalable predictive uncertainty estimation using deep ensembles. In: Proceeding NIPS\u201917, pp. 6402\u20136413, (2017)"},{"issue":"3","key":"781_CR50","doi-asserted-by":"publisher","first-page":"204","DOI":"10.14778\/2850583.2850594","volume":"9","author":"V Leis","year":"2015","unstructured":"Leis, V., Gubichev, A., Mirchev, A., Boncz, P.A., Kemper, A., Neumann, T.: How good are query optimizers, really? Proc. VLDB 9(3), 204\u2013215 (2015)","journal-title":"Proc. VLDB"},{"key":"781_CR51","doi-asserted-by":"crossref","unstructured":"Lewis, D.D., Catlett, J.: Heterogeneous uncertainty sampling for supervised learning. In: Proceedings ICML\u201994, pp. 148\u2013156, (1994)","DOI":"10.1016\/B978-1-55860-335-6.50026-X"},{"key":"781_CR52","doi-asserted-by":"crossref","unstructured":"Li, F., et al.: Wander join: Online aggregation via random walks. In: Proceedings SIGMOD\u201916, pp. 615\u2013629, (2016)","DOI":"10.1145\/2882903.2915235"},{"key":"781_CR53","doi-asserted-by":"crossref","unstructured":"Li, J., Rong, Y., Cheng, H., Meng, H., Huang, W., Huang, J.: Semi-supervised graph classification: a hierarchical graph perspective. In: Proceeding WWW\u201919, pp. 972\u2013982, (2019)","DOI":"10.1145\/3308558.3313461"},{"key":"781_CR54","doi-asserted-by":"crossref","unstructured":"Liu, X., et al.: Neural subgraph isomorphism counting. In Proceeding KDD \u201920, pp. 1959\u20131969, (2020)","DOI":"10.1145\/3394486.3403247"},{"issue":"11","key":"781_CR55","doi-asserted-by":"publisher","first-page":"1950","DOI":"10.14778\/3476249.3476254","volume":"14","author":"J Liu","year":"2021","unstructured":"Liu, J., Dong, W., Li, D., Zhou, Q.: Fauce: fast and accurate deep ensembles with uncertainty for cardinality estimation. Proc. VLDB Endow. 14(11), 1950\u20131963 (2021)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"781_CR56","doi-asserted-by":"publisher","first-page":"414","DOI":"10.14778\/3494124.3494127","volume":"15","author":"Y Lu","year":"2021","unstructured":"Lu, Y., Kandula, S., K\u00f6nig, A.C., Chaudhuri, S.: Pre-training summarization models of structured datasets for cardinality estimation. Proc. VLDB Endow. 15(3), 414\u2013426 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"781_CR57","doi-asserted-by":"crossref","unstructured":"Ma, Q., and Triantafillou, P.: Dbest: revisiting approximate query processing engines with machine learning models. In: Proceeding SIGMOD\u201919, pp. 1553\u20131570, (2019)","DOI":"10.1145\/3299869.3324958"},{"key":"781_CR58","doi-asserted-by":"crossref","unstructured":"Ma, L., Ding, B., Das, S., Swaminathan, A.: Active learning for ML enhanced database systems. In: Proceedings SIGMOD\u201920, pp. 175\u2013191, (2020)","DOI":"10.1145\/3318464.3389768"},{"issue":"4","key":"781_CR59","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1162\/neco.1992.4.4.590","volume":"4","author":"DJC MacKay","year":"1992","unstructured":"MacKay, D.J.C.: Information-based objective functions for active data selection. Neural Comput. 4(4), 590\u2013604 (1992)","journal-title":"Neural Comput."},{"issue":"8","key":"781_CR60","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1093\/bioinformatics\/btx758","volume":"34","author":"I Melckenbeeck","year":"2018","unstructured":"Melckenbeeck, I., Audenaert, P., Colle, D., Pickavet, M.: Efficiently counting all orbits of graphlets of any order in a graph using autogenerated equations. Bioinform 34(8), 1372\u20131380 (2018)","journal-title":"Bioinform"},{"issue":"11","key":"781_CR61","doi-asserted-by":"publisher","first-page":"1692","DOI":"10.14778\/3342263.3342643","volume":"12","author":"A Mhedhbi","year":"2019","unstructured":"Mhedhbi, A., Salihoglu, S.: Optimizing subgraph queries by combining binary and worst-case optimal joins. Proc. VLDB 12(11), 1692\u20131704 (2019)","journal-title":"Proc. VLDB"},{"issue":"11","key":"781_CR62","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/219717.219748","volume":"38","author":"GA Miller","year":"1995","unstructured":"Miller, G.A.: Wordnet: a lexical database for English. Commun. ACM 38(11), 39\u201341 (1995)","journal-title":"Commun. ACM"},{"key":"781_CR63","doi-asserted-by":"crossref","unstructured":"Morris, C., Ritzert, M., Fey, M., Hamilton, W.L., Lenssen, J.E., Rattan, G., Grohe, M.: Weisfeiler and leman go neural: Higher-order graph neural networks. In: AAAI\u201919, pp. 4602\u20134609. AAAI Press, (2019)","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"781_CR64","unstructured":"Mussmann, S., Liang, P.: On the relationship between data efficiency and error for uncertainty sampling. In: Proceedings ICML\u201918, pp. 3671\u20133679, (2018)"},{"key":"781_CR65","doi-asserted-by":"crossref","unstructured":"Neumann, T., Moerkotte, G.: Characteristic sets: accurate cardinality estimation for RDF queries with multiple joins. In: Proceeding ICDE\u201911, pp. 984\u2013994, (2011)","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"781_CR66","doi-asserted-by":"crossref","unstructured":"Ngo, H.Q.: Worst-case optimal join algorithms: techniques, results, and open problems. In: Proceedings PODS\u201918, pp. 111\u2013124, (2018)","DOI":"10.1145\/3196959.3196990"},{"key":"781_CR67","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s41109-017-0027-2","volume":"2","author":"M Ortmann","year":"2017","unstructured":"Ortmann, M., Brandes, U.: Efficient orbit-aware triad and quad census in directed and undirected graphs. Appl. Netw. Sci. 2, 13 (2017)","journal-title":"Appl. Netw. Sci."},{"key":"781_CR68","doi-asserted-by":"crossref","unstructured":"Paredes, P., Ribeiro, P.M.P.: Towards a faster network-centric subgraph census. In: Proceeding ASONAM \u201913, pp. 264\u2013271, (2013)","DOI":"10.1145\/2492517.2492535"},{"key":"781_CR69","doi-asserted-by":"crossref","unstructured":"Park, Y., et al.: G-CARE: a framework for performance benchmarking of cardinality estimation techniques for subgraph matching. In: Proceeding SIGMOD\u201920, pp. 1099\u20131114, (2020)","DOI":"10.1145\/3318464.3389702"},{"key":"781_CR70","doi-asserted-by":"crossref","unstructured":"Park, Y., Zhong, S., Mozafari, B.: Quicksel: Quick selectivity learning with mixture models. In: Procedding SIGMOD, pp. 1017\u20131033. ACM, (2020)","DOI":"10.1145\/3318464.3389727"},{"key":"781_CR71","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceeding KDD\u201914, pp. 701\u2013710, (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"781_CR72","doi-asserted-by":"crossref","unstructured":"Pinar, A., et al.: ESCAPE: efficiently counting all 5-vertex subgraphs. In: Proceeding WWW\u201917, pp. 1431\u20131440, (2017)","DOI":"10.1145\/3038912.3052597"},{"issue":"2","key":"781_CR73","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Przulj","year":"2007","unstructured":"Przulj, N.: Biological network comparison using graphlet degree distribution. Bioinform 23(2), 177\u2013183 (2007)","journal-title":"Bioinform"},{"key":"781_CR74","unstructured":"Pytorch Geometric. https:\/\/github.com\/rusty1s\/pytorch_geometric"},{"key":"781_CR75","unstructured":"Pytorch. https:\/\/github.com\/pytorch\/pytorch"},{"key":"781_CR76","unstructured":"Regol, F.: Active learning on attributed graphs via graph cognizant logistic regression and preemptive query generation. In: Proceeding ICML\u201920"},{"key":"781_CR77","unstructured":"Rezende, D.J., Mohamed, S.: Variational inference with normalizing flows. In: Proceeding ICML, vol.\u00a037 of JMLR Workshop and Conference Proceedings, pp. 1530\u20131538, (2015)"},{"key":"781_CR78","unstructured":"Ribeiro, P., et al.: A survey on subgraph counting: concepts, algorithms and applications to network motifs and graphlets. CoRR, abs\/1910.13011, (2019)"},{"key":"781_CR79","doi-asserted-by":"crossref","unstructured":"Settles, B.: Active learning. In: Synthesis lectures on artificial intelligence and machine learning. Morgan & Claypool Publishers, (2012)","DOI":"10.1007\/978-3-031-01560-1"},{"issue":"1","key":"781_CR80","doi-asserted-by":"publisher","first-page":"364","DOI":"10.14778\/1453856.1453899","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc. VLDB 1(1), 364\u2013375 (2008)","journal-title":"Proc. VLDB"},{"key":"781_CR81","unstructured":"Shervashidze, N., et al.: Efficient graphlet kernels for large graph comparison. In: Proceeding AISTATS\u201909, pp. 488\u2013495, (2009)"},{"key":"781_CR82","doi-asserted-by":"crossref","unstructured":"Slota, G.M., Madduri, K.: Fast approximate subgraph counting and enumeration. In: ICPP\u201913, pp. 210\u2013219. IEEE Computer Society, (2013)","DOI":"10.1109\/ICPP.2013.30"},{"issue":"1","key":"781_CR83","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava, N., Hinton, G.E., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Dropout: a simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15(1), 1929\u20131958 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"781_CR84","doi-asserted-by":"crossref","unstructured":"Stefanoni, G., Motik, B., Kostylev, E.V.: Estimating the cardinality of conjunctive queries over RDF data using graph summarisation. In: Proceedings WWW\u201918, pp. 1043\u20131052, (2018)","DOI":"10.1145\/3178876.3186003"},{"issue":"6825","key":"781_CR85","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz, S.H.: Exploring complex networks. Nature 410(6825), 268\u2013276 (2001)","journal-title":"Nature"},{"key":"781_CR86","doi-asserted-by":"crossref","unstructured":"Sun, S., Luo, Q.: In-memory subgraph matching: an in-depth study. In: Proceedings SIGMOD\u201920, pp. 1083 (2020)","DOI":"10.1145\/3318464.3380581"},{"issue":"3","key":"781_CR87","doi-asserted-by":"publisher","first-page":"307","DOI":"10.14778\/3368289.3368296","volume":"13","author":"J Sun","year":"2019","unstructured":"Sun, J., Li, G.: An end-to-end learning-based cost estimator. Proc. VLDB 13(3), 307\u2013319 (2019)","journal-title":"Proc. VLDB"},{"key":"781_CR88","unstructured":"Tahmasebi, B., and Jegelka. S.: Counting substructures with higher-order graph neural networks: possibility and impossibility results. CoRR, abs\/2012.03174, (2020)"},{"issue":"125","key":"781_CR89","doi-asserted-by":"publisher","first-page":"125ra31","DOI":"10.1126\/scitranslmed.3003377","volume":"4","author":"NP Tatonetti","year":"2012","unstructured":"Tatonetti, N.P.: Data-driven prediction of drug effects and interactions. Sci. Transl. Med. 4(125), 125ra31 (2012)","journal-title":"Sci. Transl. Med."},{"key":"781_CR90","doi-asserted-by":"crossref","unstructured":"Thirumuruganathan, S., Hasan, S., Koudas, N., Das, G.: Approximate query processing for data exploration using deep generative models. In: Proceeding ICDE\u201920, pp. 1309 (2020)","DOI":"10.1109\/ICDE48307.2020.00117"},{"key":"781_CR91","doi-asserted-by":"crossref","unstructured":"Thirumuruganathan, S., Shetiya, S., Koudas, N., Das, G.: Prediction intervals for learned cardinality estimation: an experimental evaluation. In: ICDE\u201922, pp. 3051\u20133064. IEEE, (2022)","DOI":"10.1109\/ICDE53745.2022.00274"},{"key":"781_CR92","doi-asserted-by":"crossref","unstructured":"Tsitsulin, A., et al.: VERSE: versatile graph embeddings from similarity measures. In Proceedings WWW, pp. 539\u2013548. ACM, (2018)","DOI":"10.1145\/3178876.3186120"},{"issue":"1","key":"781_CR93","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"},{"issue":"1","key":"781_CR94","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1089\/cmb.2009.0029","volume":"17","author":"V Vacic","year":"2010","unstructured":"Vacic, V., Iakoucheva, L.M., Lonardi, S., Radivojac, P.: Graphlet kernels for prediction of functional residues in protein structures. J. Comput. Biol. 17(1), 55\u201372 (2010)","journal-title":"J. Comput. Biol."},{"key":"781_CR95","unstructured":"Vaswani, A.: Attention is all you need. In: Proceedings NeurIPS\u201917, pp. 5998\u20136008, (2017)"},{"key":"781_CR96","unstructured":"Velickovic, P., Cucurull, G., Casanova, A., Romero, A., Li\u00f2, P., Bengio, Y.: Graph attention networks. In: Proc. ICLR\u201918, (2018)"},{"issue":"12","key":"781_CR97","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.14778\/2824032.2824051","volume":"8","author":"D Vengerov","year":"2015","unstructured":"Vengerov, D., Menck, A.C., Za\u00eft, M., Chakkappen, S.: Join size estimation subject to filter conditions. Proc. VLDB 8(12), 1530\u20131541 (2015)","journal-title":"Proc. VLDB"},{"key":"781_CR98","doi-asserted-by":"crossref","unstructured":"Wang, H., et al.: Neural subgraph counting with wasserstein estimator. In: SIGMOD \u201922, pp. 160\u2013175. ACM, (2022)","DOI":"10.1145\/3514221.3526163"},{"issue":"1","key":"781_CR99","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TKDE.2017.2756836","volume":"30","author":"P Wang","year":"2018","unstructured":"Wang, P., Zhao, J., Zhang, X., Li, Z., Cheng, J., Lui, J.C.S., Towsley, D., Tao, J., Guan, X.: MOSS-5: A fast method of approximating counts of 5-node graphlets in large graphs. IEEE Trans. Knowl. Data Eng. 30(1), 73\u201386 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"781_CR100","doi-asserted-by":"publisher","first-page":"72","DOI":"10.14778\/3485450.3485458","volume":"15","author":"J Wang","year":"2021","unstructured":"Wang, J., Chai, C., Liu, J., Li, G.: FACE: A normalizing flow based cardinality estimator. Proc. VLDB Endow. 15(1), 72\u201384 (2021)","journal-title":"Proc. VLDB Endow."},{"issue":"6684","key":"781_CR101","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"9","key":"781_CR102","first-page":"12","volume":"2","author":"B Weisfeiler","year":"1968","unstructured":"Weisfeiler, B., Lehman, A.A.: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia 2(9), 12\u201316 (1968)","journal-title":"Nauchno-Technicheskaya Informatsia"},{"key":"781_CR103","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: Proceeding ICLR\u201919, (2019)"},{"issue":"3","key":"781_CR104","doi-asserted-by":"publisher","first-page":"279","DOI":"10.14778\/3368289.3368294","volume":"13","author":"Z Yang","year":"2019","unstructured":"Yang, Z., Liang, E., Kamsetty, A., Wu, C., Duan, Y., Chen, P., Abbeel, P., Hellerstein, J.M., Krishnan, S., Stoica, I.: Deep unsupervised cardinality estimation. Proc. VLDB 13(3), 279\u2013292 (2019)","journal-title":"Proc. VLDB"},{"issue":"5","key":"781_CR105","doi-asserted-by":"publisher","first-page":"670","DOI":"10.14778\/3377369.3377376","volume":"13","author":"R Yang","year":"2020","unstructured":"Yang, R., Shi, J., Xiao, X., Yang, Y., Bhowmick, S.S.: Homogeneous network embedding for massive graphs via reweighted personalized pagerank. Proc. VLDB 13(5), 670\u2013683 (2020)","journal-title":"Proc. VLDB"},{"issue":"1","key":"781_CR106","doi-asserted-by":"publisher","first-page":"61","DOI":"10.14778\/3421424.3421432","volume":"14","author":"Z Yang","year":"2020","unstructured":"Yang, Z., Kamsetty, A., Luan, S., Liang, E., Duan, Y., Chen, P., Stoica, I.: Neurocard: one cardinality estimator for all tables. Proc. VLDB Endow. 14(1), 61\u201373 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"781_CR107","doi-asserted-by":"crossref","unstructured":"Yin, Y., Wei, Z.: Scalable graph embeddings via sparse transpose proximities. In: Proceeding KDD, pp. 1429\u20131437. ACM, (2019)","DOI":"10.1145\/3292500.3330860"},{"key":"781_CR108","unstructured":"Ying, Z.: Hierarchical graph representation learning with differentiable pooling. In: Proceeding NeurIPS\u201918, pp. 4805\u20134815, (2018)"},{"key":"781_CR109","unstructured":"Zhang, Y., Yang, Q.: A survey on multi-task learning. CoRR, abs\/1707.08114, (2017)"},{"key":"781_CR110","doi-asserted-by":"crossref","unstructured":"Zhang, L., Song, M., Liu, Z., Liu, X., Bu, J., Chen, C.: Probabilistic graphlet cut: exploiting spatial structure cue for weakly supervised image segmentation. In: Proceeding CVPR\u201913, pp. 1908\u20131915, (2013)","DOI":"10.1109\/CVPR.2013.249"},{"key":"781_CR111","doi-asserted-by":"crossref","unstructured":"Zhang, X., Xie, K., Wang, S., Huang, Z.: Learning based proximity matrix factorization for node embedding. In: Proceeding KDD, pp. 2243\u20132253. ACM, (2021)","DOI":"10.1145\/3447548.3467296"},{"key":"781_CR112","doi-asserted-by":"crossref","unstructured":"Zhang, H., Yu, J.X., Zhang, Y., Zhao, K., Cheng, H.: Distributed subgraph counting: a general approach. Proc. VLDB, 13(11), (2020)","DOI":"10.14778\/3407790.3407840"},{"key":"781_CR113","doi-asserted-by":"crossref","unstructured":"Zhang, Y.: Multi-task active learning with output constraints. In: Proceedings AAAI\u201910, (2010)","DOI":"10.1609\/aaai.v24i1.7698"},{"key":"781_CR114","doi-asserted-by":"crossref","unstructured":"Zhang, J.: Prone: fast and scalable network representation learning. In: Proceeding IJCAI\u201919, pp. 4278\u20134284, (2019)","DOI":"10.24963\/ijcai.2019\/594"},{"issue":"2","key":"781_CR115","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1109\/TIP.2012.2223226","volume":"22","author":"L Zhang","year":"2013","unstructured":"Zhang, L., Song, M., Zhao, Q., Liu, X., Bu, J., Chen, C.: Probabilistic graphlet transfer for photo cropping. IEEE Trans. Image Process. 22(2), 802\u2013815 (2013)","journal-title":"IEEE Trans. Image Process."},{"key":"781_CR116","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Christensen, R., Li, F., Hu, X., Yi, K.: Random sampling over joins revisited. In: Proceeding SIGMOD\u201918, pp. 1525\u20131539, (2018)","DOI":"10.1145\/3183713.3183739"},{"key":"781_CR117","doi-asserted-by":"crossref","unstructured":"Zhao, K., Yu, J.X., Zhang, H., Li, Q., Rong, Y.: A learned sketch for subgraph counting. In: SIGMOD\u201921, pp. 2142\u20132155. ACM, (2021)","DOI":"10.1145\/3448016.3457289"},{"key":"781_CR118","doi-asserted-by":"crossref","unstructured":"Zhao, K.: Lightweight and accurate cardinality estimation by neural network gaussian process. In: SIGMOD \u201922, pp. 973\u2013987. ACM, (2022)","DOI":"10.1145\/3514221.3526156"},{"issue":"1","key":"781_CR119","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms14049","volume":"8","author":"GX Zheng","year":"2017","unstructured":"Zheng, G.X., Terry, J.M., Belgrader, P., Ryvkin, P., Bent, Z.W., Wilson, R., Ziraldo, S.B., Wheeler, T.D., McDermott, G.P., Zhu, J., et al.: Massively parallel digital transcriptional profiling of single cells. Nat. Commun. 8(1), 1\u201312 (2017)","journal-title":"Nat. Commun."},{"key":"781_CR120","unstructured":"Zhou, J., Cui, G., Zhang, Z., Yang, C., Liu, Z., Sun, M.: Graph neural networks: a review of methods and applications. CoRR, abs\/1812.08434, (2018)"},{"key":"781_CR121","doi-asserted-by":"crossref","unstructured":"Zhou, C.: Scalable graph embedding for asymmetric proximity. In: Proceeding AAAI, pp. 2942\u20132948. AAAI Press, (2017)","DOI":"10.1609\/aaai.v31i1.10878"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00781-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-023-00781-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-023-00781-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T18:33:49Z","timestamp":1728844429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-023-00781-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,9]]},"references-count":121,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["781"],"URL":"https:\/\/doi.org\/10.1007\/s00778-023-00781-5","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,9]]},"assertion":[{"value":"6 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}