{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:16Z","timestamp":1742914156070,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203084"},{"type":"electronic","value":"9783031203091"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20309-1_44","type":"book-chapter","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T06:11:35Z","timestamp":1670393495000},"page":"497-509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Subhypergraph Containment Queries on\u00a0Hypergraph Databases"],"prefix":"10.1007","author":[{"given":"Yuhang","family":"Su","sequence":"first","affiliation":[]},{"given":"Yang","family":"Song","sequence":"additional","affiliation":[]},{"given":"Xiaohua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Fangfang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,8]]},"reference":[{"key":"44_CR1","unstructured":"Berge, C.: Hypergraphs: Combinatorics of Finite Sets, vol. 45. Elsevier, Amsterdam (1984)"},{"issue":"1","key":"44_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"HM Berman","year":"2000","unstructured":"Berman, H.M., et al.: The protein data bank. Nucl. Acids Res. 28(1), 235\u2013242 (2000)","journal-title":"Nucl. Acids Res."},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: Proceedings of the 2016 ACM SIGMOD International Conference on Management of Data, pp. 1199\u20131214 (2016)","DOI":"10.1145\/2882903.2915236"},{"key":"44_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-16001-1_17","volume-title":"Pattern Recognition in Bioinformatics","author":"V Bonnici","year":"2010","unstructured":"Bonnici, V., Ferro, A., Giugno, R., Pulvirenti, A., Shasha, D.: Enhancing graph database indexing by suffix tree structure. In: Dijkstra, T.M.H., Tsivtsivadze, E., Marchiori, E., Heskes, T. (eds.) PRIB 2010. LNCS, vol. 6282, pp. 195\u2013203. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16001-1_17"},{"issue":"3","key":"44_CR5","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/S0031-3203(01)00067-X","volume":"35","author":"A Bretto","year":"2002","unstructured":"Bretto, A., Cherifi, H., Aboutajdine, D.: Hypergraph imaging: an overview. Pattern Recogn. 35(3), 651\u2013658 (2002)","journal-title":"Pattern Recogn."},{"key":"44_CR6","doi-asserted-by":"publisher","unstructured":"Bunke, H., Dickinson, P., Kraetzl, M., Neuhaus, M., Stettler, M.: Matching of hypergraphs: algorithms, applications, and experiments. In: Bunke, H., Kandel, A., Last, M. (eds) Applied Pattern Recognition, vol. 91, pp. 131\u2013154. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-76831-9_6","DOI":"10.1007\/978-3-540-76831-9_6"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W., Lu, A.: FG-Index: towards verification-free query processing on graph databases. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 857\u2013872 (2007)","DOI":"10.1145\/1247480.1247574"},{"issue":"10","key":"44_CR8","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0076911","volume":"8","author":"R Giugno","year":"2013","unstructured":"Giugno, R., Bonnici, V., Bombieri, N., Pulvirenti, A., Ferro, A., Shasha, D.: Grapes: a software for parallel searching on biological graphs targeting multi-core architectures. PLoS ONE 8(10), e76911 (2013)","journal-title":"PLoS ONE"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Ha, T.W., Seo, J.H., Kim, M.H.: Efficient searching of subhypergraph isomorphism in hypergraph databases. In: IEEE International Conference on Big Data and Smart Computing (2018)","DOI":"10.1109\/BigComp.2018.00140"},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 405\u2013418 (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Hwang, T.H., Tian, Z., Kuang, R., Kocher, J.P.: Learning on weighted hypergraphs to integrate protein interactions and gene expressions for cancer outcome prediction. In: Eighth IEEE International Conference on Data Mining (2008)","DOI":"10.1109\/ICDM.2008.37"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Katsarou, F., Ntarmos, N., Triantafillou, P.: Hybrid algorithms for subgraph pattern queries in graph databases. In: 2017 IEEE International Conference on Big Data (Big Data), pp. 656\u2013665. IEEE (2017)","DOI":"10.1109\/BigData.2017.8257981"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Klein, K., Kriege, N., Mutzel, P.: CT-Index: fingerprint-based graph indexing combining cycles and trees. In: 2011 IEEE 27th International Conference on Data Engineering, pp. 1115\u20131126. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767909"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Knoke, D., Yang, S.: Social Network Analysis. Sage Publications, Thousand Oaks (2019)","DOI":"10.4135\/9781506389332"},{"key":"44_CR15","unstructured":"Ramadan, E., Tarafdar, A., Pothen, A.: A hypergraph model for the yeast protein complex network. In: 18th International Parallel and Distributed Processing Symposium. Proceedings, p. 189. IEEE (2004)"},{"issue":"1","key":"44_CR16","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 Endow. 1(1), 364\u2013375 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Su, Y., Gu, Y., Wang, Z., Zhang, Y., Qin, J., Yu, G.: Efficient subhypergraph matching based on hyperedge features. IEEE Transactions on Knowledge and Data Engineering (2022)","DOI":"10.1109\/TKDE.2022.3160393"},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Sun, S., Luo, Q.: Scaling up subgraph query processing with efficient subgraph matching. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 220\u2013231. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00028"},{"issue":"3","key":"44_CR19","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/34.21797","volume":"11","author":"AKC Wong","year":"1989","unstructured":"Wong, A.K.C., Lu, S.W.: Recognition and shape synthesis of 3-d objects based on attributed hypergraphs. IEEE Trans. Pattern Anal. Mach. Intell. 11(3), 279\u2013290 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"44_CR20","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00778-012-0284-8","volume":"22","author":"D Yuan","year":"2013","unstructured":"Yuan, D., Mitra, P.: Lindex: a lattice-based index for graph databases. VLDB J. 22(2), 229\u2013252 (2013)","journal-title":"VLDB J."},{"key":"44_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-030-60029-7_43","volume-title":"Web Information Systems and Applications","author":"H Zhang","year":"2020","unstructured":"Zhang, H., Xie, X., Wen, Y., Zhang, Y.: A twig-based algorithm for top-k subgraph matching in large-scale graph data. In: Wang, G., Lin, X., Hendler, J., Song, W., Xu, Z., Liu, G. (eds.) WISA 2020. LNCS, vol. 12432, pp. 475\u2013487. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60029-7_43"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20309-1_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T20:08:29Z","timestamp":1674590909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20309-1_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203084","9783031203091"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20309-1_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dalian","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/web\/html7\/index.html?globalId=m9475032704175349761645943983427&type=1","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"212","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":"45","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":"19","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":"21% - 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":"3","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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}