{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:13:10Z","timestamp":1743016390136,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683084"},{"type":"electronic","value":"9783031683091"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68309-1_4","type":"book-chapter","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T14:02:25Z","timestamp":1723903345000},"page":"43-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Subgraph Search with\u00a0Graph Code Indices"],"prefix":"10.1007","author":[{"given":"Naoya","family":"Funamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akihiro","family":"Inokuchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,18]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Bonnici, V., et al.: Enhancing graph database indexing by suffix tree structure. In: Proceedings of International Conference on Pattern Recognition in Bioinformatics, pp. 195\u2013203 (2010)","DOI":"10.1007\/978-3-642-16001-1_17"},{"key":"4_CR2","unstructured":"Chen, C., et al.: Towards graph containment search and indexing. In: Proceedings of International Conference on Very Large Data Bases, pp.\u00a0926\u2013937 (2007)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, J., et al.: FG-index: towards verification-free query processing on graph databases. In: Proceedings of International Conference on Management of Data, pp.\u00a0857\u2013872 (2007)","DOI":"10.1145\/1247480.1247574"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1508857.1508859","volume":"34","author":"J Cheng","year":"2009","unstructured":"Cheng, J., et al.: Efficient query processing on graph databases. ACM Trans. Database Syst. 34(2), 1\u201348 (2009)","journal-title":"ACM Trans. Database Syst."},{"issue":"10","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L Cordella","year":"2004","unstructured":"Cordella, L., et al.: 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":"4_CR6","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. H. Freeman (1979)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Giugno, R., et al.: GRAPES: a software for parallel searching on biological graphs targeting multi-core architectures. PloS One 8(10) (2013)","DOI":"10.1371\/journal.pone.0076911"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.: Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of International Conference on Management of Data, pp.\u00a0405\u2013418 (2008)","DOI":"10.1145\/1376616.1376660"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1587\/transinf.2019EDP7011","volume":"103\u2013D","author":"S Imai","year":"2020","unstructured":"Imai, S., Inokuchi, A.: Efficient supergraph search using graph coding. IEICE Trans. Inf. Syst. 103\u2013D(1), 130\u2013141 (2020)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"4_CR10","unstructured":"Inokuchi, A., et al.: A Fast algorithm for mining frequent connected subgraphs. IBM Research Report, RT0448, IBM Research (2002)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.14778\/3397230.3397241","volume":"13","author":"H Kim","year":"2020","unstructured":"Kim, H., et al.: IDAR: fast supergraph search using DAG integration. Proc. of VLDB Endow. 13, 1456\u20131468 (2020)","journal-title":"Proc. of VLDB Endow."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Kim, H., et al.: Versatile equivalences: speeding up subgraph query processing\u00a0and subgraph matching. In: Proceedings of International Conference on Management of Data, pp.\u00a0925\u2013937 (2021)","DOI":"10.1145\/3448016.3457265"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Klein, K., et al.: CT-index: fingerprint-based graph indexing combining cycles and trees. In: Proceedings of International Conference on Data Engineering, pp.\u00a01115\u20131126 (2011)","DOI":"10.1109\/ICDE.2011.5767909"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Lyu, B., et al.: Scalable supergraph search in large graph databases. In: Proceedings of International Conference on Data Engineering, pp. 157\u2013168 (2016)","DOI":"10.1109\/ICDE.2016.7498237"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Natale, R., et al.: SING: subgraph search in non-homogeneous graphs. BMC Bioinform. 11(96) (2010)","DOI":"10.1186\/1471-2105-11-96"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Qin, Z., et al.: GHashing: semantic graph hashing for approximate similarity search in graph databases. In: Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp.\u00a02062\u20132072 (2020)","DOI":"10.1145\/3394486.3403257"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Shasha, D., et al.: Algorithmics and applications of tree and graph searching. In: Proceedings of Symposium on Principles of Database Systems, pp.\u00a039\u201352 (2002)","DOI":"10.1145\/543613.543620"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Sun, S., Luo, Q.: Scaling up subgraph query processing with efficient subgraph matching. In: Proceedings of IEEE International Conference on Data Engineering, pp. 220\u2013231 (2019)","DOI":"10.1109\/ICDE.2019.00028"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Williams, D., et al.: Graph database indexing using structured graph decomposition. Proceedings of IEEE International Conference on Data Engineering, pp.\u00a0976\u2013985 (2007)","DOI":"10.1109\/ICDE.2007.368956"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Xie, Y., Yu, P.: CP-index: on the efficient indexing of large graphs. In: Proceedings of ACM Conference on Information and Knowledge Management, pp.\u00a01795\u20131804 (2011)","DOI":"10.1145\/2063576.2063835"},{"key":"4_CR21","unstructured":"Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Proceedings of IEEE International Conference on Data Mining (ICDM), pp. 721\u2013724 (2002)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Yan, X., et al.: Graph indexing: a frequent structure-based approach. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp.\u00a0335\u2013346 (2002)","DOI":"10.1145\/1007568.1007607"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Yuan, D., Mitra, P.: Lindex: a lattice-based index for graph databases. VLDB J. 229\u2013252 (2013)","DOI":"10.1007\/s00778-012-0284-8"},{"key":"4_CR24","unstructured":"Zhao, P., et al.: Graph indexing: tree + delta $$>$$= graph. In: Proceedings of International Conference on Very Large Data Bases, pp. 938\u2013949 (2007)"},{"issue":"8","key":"4_CR25","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/TKDE.2019.2906608","volume":"32","author":"Y Zhu","year":"2020","unstructured":"Zhu, Y., et al.: Answering Top-$$k$$ k graph similarity queries in graph databases. IEEE Trans. Knowl. Data Eng. 32(8), 1459\u20131474 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68309-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T20:16:21Z","timestamp":1732652181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68309-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683084","9783031683091"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68309-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Naples","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}