{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T09:57:55Z","timestamp":1717840675317},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,1,15]],"date-time":"2015-01-15T00:00:00Z","timestamp":1421280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10115-014-0816-1","type":"journal-article","created":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T14:33:14Z","timestamp":1421245994000},"page":"629-656","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Extend tree edit distance for effective object identification"],"prefix":"10.1007","volume":"46","author":[{"given":"Yue","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Liyan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,15]]},"reference":[{"issue":"24","key":"816_CR1","doi-asserted-by":"crossref","first-page":"4975","DOI":"10.1016\/j.ins.2010.08.022","volume":"180","author":"A Algergawy","year":"2010","unstructured":"Algergawy A, Nayak R, Saake R (2010) Element similarity measures in XML schema matching. J Inf Sci 180(24):4975\u20134998","journal-title":"J Inf Sci"},{"key":"816_CR2","unstructured":"Augsten N, Bohlen M, Gamper J (2005) Approximate matching of hierarchical data using pq-grams. In: Proceeding of the 31st VLDB conferences, Trondheim, pp 301\u2013312"},{"key":"816_CR3","doi-asserted-by":"crossref","unstructured":"Augsten N, Bohlen M, Gamper J (2010) The pq-gram distance between ordered labeled trees. ACM Trans Database Syst 35(1):4(1)\u20134(36)","DOI":"10.1145\/1670243.1670247"},{"issue":"1\u20133","key":"816_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille P (2005) A survey on tree edit distance and related problems. Theor Comput Sci 337(1\u20133):217\u2013239","journal-title":"Theor Comput Sci"},{"key":"816_CR5","first-page":"146","volume-title":"ICALP, LNCS","author":"ED Demaine","year":"2007","unstructured":"Demaine ED, Mozes S, Rossman B, Weimann O (2007) An optimal decomposition algorithm for tree edit distance. In: Arge L, Cachin C, Jurdzinski T, Tarlecki A (eds) ICALP, LNCS, vol 4596. Springer, Heidelberg, pp 146\u2013157"},{"key":"816_CR6","doi-asserted-by":"crossref","unstructured":"Dulucq S, Touzet H (2003) Analysis of tree edit distance algorithms. In: Proceeding of the 14th annual symposium on Combinatorial Pattern Matching (CPM), pp 83\u201395","DOI":"10.1007\/3-540-44888-8_7"},{"issue":"1","key":"816_CR7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/1061318.1061326","volume":"30","author":"M Garofalakis","year":"2005","unstructured":"Garofalakis M, Kumar A (2005) XML stream processing using tree-edit distance embeddings. ACM Trans Database Syst 30(1):279\u2013332","journal-title":"ACM Trans Database Syst"},{"key":"816_CR8","doi-asserted-by":"crossref","unstructured":"Guha S, Jagadish HV, Koudas N et al (2002) Approximate XML joins. ACM SIGMOD, Madison, Wisconsin","DOI":"10.1145\/564691.564725"},{"issue":"1","key":"816_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/1132863.1132868","volume":"31","author":"S Guha","year":"2006","unstructured":"Guha S, Jagadish HV, Koudas N et al (2006) Integrating XML data sources using approximate joins. ACM Trans Database Syst 31(1):161\u2013207","journal-title":"ACM Trans Database Syst"},{"key":"816_CR10","unstructured":"Han Z, Wang H, Gao H et al (2009) Clustering-based approximate join method on XML documents. J Comput Res Dev. ISSN1000-1239\/CN 11\u20131177\/TP46(Suppl.): 81\u201386"},{"key":"816_CR11","doi-asserted-by":"crossref","unstructured":"Kailing K, Kriegel H, Schonauer S et al (2004) Efficient similarity search for hierarchical data in large databases. In: Bertino E, Christodoulakis S, Plexousakis D, Vassilis C, Koubarakis M, B\u00f6hm K, Ferrari E (eds) Advances in database technology - EDBT 2004. Lecture notes in computer science, vol 2992. Springer, Heidelberg, pp 676\u2013693","DOI":"10.1007\/978-3-540-24741-8_39"},{"key":"816_CR12","doi-asserted-by":"crossref","unstructured":"Klein PH (1998) Computing the edit-distance between unrooted ordered trees. ESA\u201998, LNCS 1461:91\u2013102","DOI":"10.1007\/3-540-68530-8_8"},{"key":"816_CR13","first-page":"125","volume":"6185","author":"F Li","year":"2010","unstructured":"Li F, Wang H, Hao L et al (2010) pq-hash: an efficient method for approximate XML joins. WAIM 2010 Workshops LNCS 6185:125\u2013134","journal-title":"WAIM 2010 Workshops LNCS"},{"key":"816_CR14","doi-asserted-by":"crossref","unstructured":"Li F, Wang H, Zhang C et al (2010) Approximate joins for XML using $$g$$ g -string. XSym 2010, LNCS 6309, pp. 3\u201317","DOI":"10.1007\/978-3-642-15684-7_2"},{"key":"816_CR15","volume-title":"Some lower and upper bounds for tree edit distance","author":"S Mozes","year":"2008","unstructured":"Mozes S (2008) Some lower and upper bounds for tree edit distance. Department of Computer Science, Brown University, Providence, RI"},{"issue":"3","key":"816_CR16","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"KC Tai","year":"1979","unstructured":"Tai KC (1979) The tree-to-tree correction problem. J ACM 26(3):422\u2013433","journal-title":"J ACM"},{"key":"816_CR17","doi-asserted-by":"crossref","unstructured":"Tatikonda S, Parthasarathy S (2010) Hashing tree-structured data: methods and applications. In: IEEE 26th international conference on data engineering (ICDE), pp 429\u2013440","DOI":"10.1109\/ICDE.2010.5447882"},{"key":"816_CR18","doi-asserted-by":"crossref","unstructured":"Wang Y, Wang H, Wang Y et al (2012) Similarity join on XML based on $$k$$ k -generation set distance. WAIM 2011 Workshops, LNCS 7142, Springer, Heidelberg, pp 124\u2013135","DOI":"10.1007\/978-3-642-28635-3_11"},{"issue":"1\u20134","key":"816_CR19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ins.2003.11.005","volume":"167","author":"Z Yang","year":"2004","unstructured":"Yang Z, Yang G (2004) A near-optimal similarity join algorithm and performance evaluation. J Inf Sci 167(1\u20134):87\u2013108","journal-title":"J Inf Sci"},{"issue":"1\u20132","key":"816_CR20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ins.2004.02.013","volume":"169","author":"S Yi","year":"2005","unstructured":"Yi S, Huang B, Chan WT (2005) XML application schema matching using similarity measure and relaxation labeling. J Inf Sci 169(1\u20132):27\u201346","journal-title":"J Inf Sci"},{"issue":"6","key":"816_CR21","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang K, Shasha D (1989) Simple fast algorithms for the editing distance between trees and related problems. SIAM J Comput 18(6):1245\u20131262","journal-title":"SIAM J Comput"},{"key":"816_CR22","unstructured":"Shasha D, Zhang K (1995) Approximate tree pattern matching. Pattern matching in strings, trees and arrays. chapter 14, Oxford University Press"},{"key":"816_CR23","unstructured":"Chawathe SS (1999) Comparing hierarchical data in external memory. In: Proceedings of the twenty-fifth International conference on very large data bases (VLDB), pp 90\u2013101"},{"key":"816_CR24","unstructured":"Nierman A, Jagadish HV (2002) Evaluating structural similarity in XML documents. In Proceedings of the 5th international workshop on the Web and Databases"},{"key":"816_CR25","unstructured":"Flesca S, Manco G, Masciari G et al (2002) Detecting structural similarities between XML documents. In: Proceedings of WebDB, pp 55\u201360"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0816-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-014-0816-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0816-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T18:30:12Z","timestamp":1566239412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-014-0816-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,15]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["816"],"URL":"https:\/\/doi.org\/10.1007\/s10115-014-0816-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,15]]}}}