{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:07:37Z","timestamp":1743073657483,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683220"},{"type":"electronic","value":"9783031683237"}],"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-68323-7_6","type":"book-chapter","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T07:02:18Z","timestamp":1723878138000},"page":"72-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Subtree Similarity Search Based on\u00a0Structure and\u00a0Text"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9596-4039","authenticated-orcid":false,"given":"Takuya","family":"Mizokami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6745-3467","authenticated-orcid":false,"given":"Savong","family":"Bou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0595-2230","authenticated-orcid":false,"given":"Toshiyuki","family":"Amagasa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,18]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Akutsu, T.: Tree edit distance problems: algorithms and applications to bioinformatics. IEICE Trans. Inf. Syst. E93.D(2), 208\u2013218 (2010). https:\/\/doi.org\/10.1587\/transinf.E93.D.208","DOI":"10.1587\/transinf.E93.D.208"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Augsten, N., Barbosa, D., et\u00a0al.: TASM: top-k approximate subtree matching. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp. 353\u2013364 (2010). https:\/\/doi.org\/10.1109\/ICDE.2010.5447905","DOI":"10.1109\/ICDE.2010.5447905"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337(1), 217\u2013239 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.12.030. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397505000174","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Cohen, S.: Indexing for subtree similarity-search using edit distance. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, pp. 49\u201360. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2463676.2463716","DOI":"10.1145\/2463676.2463716"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Demaine, E.D., Mozes, S., et\u00a0al.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6(1) (2010). https:\/\/doi.org\/10.1145\/1644015.1644017","DOI":"10.1145\/1644015.1644017"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., et\u00a0al.: Optimal aggregation algorithms for middleware. In: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 102\u2013113 (2001)","DOI":"10.1145\/375551.375567"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Falleri, J.R., Morandat, F., et\u00a0al.: Fine-grained and accurate source code differencing. In: Proceedings of the 29th ACM\/IEEE International Conference on Automated Software Engineering, ASE 2014, pp. 313\u2013324. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2642937.2642982","DOI":"10.1145\/2642937.2642982"},{"issue":"11","key":"6_CR8","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/TSE.2007.70731","volume":"33","author":"B Fluri","year":"2007","unstructured":"Fluri, B., Wursch, M., et al.: Change distilling: tree differencing for fine-grained source code change extraction. IEEE Trans. Softw. Eng. 33(11), 725\u2013743 (2007). https:\/\/doi.org\/10.1109\/TSE.2007.70731","journal-title":"IEEE Trans. Softw. Eng."},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Guha, S., Jagadish, H.V., et\u00a0al.: Approximate XML joins. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002, pp. 287\u2013298. Association for Computing Machinery, New York (2002). https:\/\/doi.org\/10.1145\/564691.564725","DOI":"10.1145\/564691.564725"},{"issue":"26","key":"6_CR10","doi-asserted-by":"publisher","first-page":"2423","DOI":"10.1016\/j.tcs.2010.01.014","volume":"411","author":"C Herrbach","year":"2010","unstructured":"Herrbach, C., Denise, A., et al.: Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of a RNA secondary structure alignment algorithm. Theor. Comput. Sci. 411(26), 2423\u20132432 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.01.014","journal-title":"Theor. Comput. Sci."},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"H\u00fctter, T., Augsten, N., et\u00a0al.: JEDI: these aren\u2019t the JSON documents you\u2019re looking for... In: Proceedings of the 2022 International Conference on Management of Data, SIGMOD 2022, pp. 1584\u20131597. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3514221.3517850","DOI":"10.1145\/3514221.3517850"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"H\u00fctter, T., Pawlik, M., et\u00a0al.: Effective filters and linear time verification for tree similarity joins. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 854\u2013865 (2019). https:\/\/doi.org\/10.1109\/ICDE.2019.00081","DOI":"10.1109\/ICDE.2019.00081"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/978-3-540-24741-8_39","volume-title":"Advances in Database Technology - EDBT 2004","author":"K Kailing","year":"2004","unstructured":"Kailing, K., Kriegel, H.-P., Sch\u00f6nauer, S., Seidl, T.: Efficient similarity search for hierarchical data in large databases. In: Bertino, E., et al. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 676\u2013693. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24741-8_39"},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.3233\/FI-2014-1054","volume":"132","author":"T Kan","year":"2014","unstructured":"Kan, T., Higuchi, S., et al.: Segmental mapping and distance for rooted labeled ordered trees. Fundam. Informaticae 132(4), 461\u2013483 (2014). https:\/\/doi.org\/10.3233\/FI-2014-1054","journal-title":"Fundam. Informaticae"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Karpov, N., Zhang, Q.: Syncsignature: a simple, efficient, parallelizable framework for tree similarity joins. Proc. VLDB Endow. 16(2), 330\u2013342 (2022). https:\/\/doi.org\/10.14778\/3565816.3565833","DOI":"10.14778\/3565816.3565833"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Kocher, D., Augsten, N.: A scalable index for top-k subtree similarity queries. In: Proceedings of the 2019 International Conference on Management of Data, SIGMOD 2019, pp. 1624\u20131641. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3299869.3319892","DOI":"10.1145\/3299869.3319892"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Li, F., Wang, H., et\u00a0al.: A survey on tree edit distance lower bound estimation techniques for similarity join on XML data. SIGMOD Rec. 42(4), 29\u201339 (2014). https:\/\/doi.org\/10.1145\/2590989.2590994","DOI":"10.1145\/2590989.2590994"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Pawlik, M., Augsten, N.: RTED: a robust algorithm for the tree edit distance. Proc. VLDB Endow. 5(4), 334\u2013345 (2011). https:\/\/doi.org\/10.14778\/2095686.2095692","DOI":"10.14778\/2095686.2095692"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.is.2015.08.004","volume":"56","author":"M Pawlik","year":"2016","unstructured":"Pawlik, M., Augsten, N.: Tree edit distance: robust and memory-efficient. Inf. Syst. 56, 157\u2013173 (2016). https:\/\/doi.org\/10.1016\/j.is.2015.08.004","journal-title":"Inf. Syst."},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Pawlik, M., Augsten, N.: Minimal edit-based diffs for large trees. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, CIKM 2020, pp. 1225\u20131234. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3340531.3412026","DOI":"10.1145\/3340531.3412026"},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1016\/j.jda.2006.07.002","volume":"5","author":"H Touzet","year":"2007","unstructured":"Touzet, H.: Comparing similar ordered trees in linear-time. J. Discret. Algorithms 5(4), 696\u2013705 (2007). https:\/\/doi.org\/10.1016\/j.jda.2006.07.002","journal-title":"J. Discret. Algorithms"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Wang, J., Yang, J., Zhang, W.: Top-k tree similarity join. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, CIKM 2021, pp. 1939\u20131948. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3459637.3482304","DOI":"10.1145\/3459637.3482304"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/11602613_39","volume-title":"Algorithms and Computation","author":"L Wang","year":"2005","unstructured":"Wang, L., Zhang, K.: Space efficient algorithms for ordered tree comparison. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 380\u2013391. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11602613_39"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Xu, P., Lu, J.: Towards a unified framework for string similarity joins. Proc. VLDB Endow. 12(11), 1289\u20131302 (2019). https:\/\/doi.org\/10.14778\/3342263.3342268","DOI":"10.14778\/3342263.3342268"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Yang, R., Kalnis, P., Tung, A.K.H.: Similarity evaluation on tree-structured data. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, SIGMOD 2005, pp. 754\u2013765. Association for Computing Machinery, New York (2005). https:\/\/doi.org\/10.1145\/1066157.1066243","DOI":"10.1145\/1066157.1066243"},{"issue":"6","key":"6_CR26","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245\u20131262 (1989). https:\/\/doi.org\/10.1137\/0218082","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68323-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T07:02:48Z","timestamp":1723878168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68323-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683220","9783031683237"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68323-7_6","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":"DaWaK","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics and Knowledge Discovery","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":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dawak2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dawak2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}