{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T05:21:05Z","timestamp":1736227265401,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311423"},{"type":"electronic","value":"9783540324379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11610113_29","type":"book-chapter","created":{"date-parts":[[2005,12,14]],"date-time":"2005-12-14T10:23:32Z","timestamp":1134555812000},"page":"319-330","source":"Crossref","is-referenced-by-count":5,"title":["Approximate Top-k Structural Similarity Search over XML Documents"],"prefix":"10.1007","author":[{"given":"Tao","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaofeng","family":"Sha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoling","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","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.\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Dalamagas, T., Cheng, T., Winkel, K., Sellis, T.: Clustering XML Documents using Structural Summaries. In: EDBT Workshops, pp. 547\u2013556 (2004)","DOI":"10.1007\/978-3-540-30192-9_54"},{"issue":"3","key":"29_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K. Tai","year":"1979","unstructured":"Tai, K.: The Tree-to-Tree Correction Problem. J. of the ACM\u00a026(3), 422\u2013433 (1979)","journal-title":"J. of the ACM"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/21.286387","volume":"24","author":"D. Shasha","year":"1994","unstructured":"Shasha, D., Wang, J., Zhang, K., Shih, F.: Exact and approximate algorithms for unordered tree matching. IEEE rans. Sys. Man. Cyber.\u00a024, 668\u2013678 (1994)","journal-title":"IEEE rans. Sys. Man. Cyber."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Selkow, S.: The tree-to-tree editing problem. Information Processing Letters\u00a06, 184\u2013186","DOI":"10.1016\/0020-0190(77)90064-3"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01975866","volume":"15","author":"K. Zhang","year":"1996","unstructured":"Zhang, K.: A constrained editing distance between unordered labeled trees. Algorithmica\u00a015, 205\u2013222 (1996)","journal-title":"Algorithmica"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K. Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Inf. Process. Lett.\u00a042, 133\u2013139 (1992)","journal-title":"Inf. Process. Lett."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Castro, D., Golgher, P., Silva, A., Laender, A.: Automatic web news extraction using tree edit distance. In: WWW, pp. 502\u2013511 (2004)","DOI":"10.1145\/988672.988740"},{"key":"29_CR9","unstructured":"Nierman, A., Jagadish, H.: Evaluating structural similarity in XML documents. In: WebDB, pp. 61\u201366 (2002)"},{"key":"29_CR10","unstructured":"Chawathe, S.: Comparing hierarchical data in extended memory. In: VLDB, pp. 90\u2013101 (1999)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Kailing, K., Kriegel, H., Sch\u00f6nauer, S., Seidl, T.: Efficient Similarity Search for Hierarchical Data in Large Databases. In: EDBT, pp. 676\u2013693 (2004)","DOI":"10.1007\/978-3-540-24741-8_39"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Yang, R., Kalnis, P., Tung, K.: Similarity Evaluation on Tree-structured Data. In: SIGMOD, pp. 754\u2013765 (2005)","DOI":"10.1145\/1066157.1066243"},{"key":"29_CR13","unstructured":"Bertino, E., Guerrini, G., Mesiti, M.: Measuring the Structural Similarity among XML Documents and DTDs (2001), http:\/\/www.disi.unige.it\/person\/MesitiM"},{"key":"29_CR14","unstructured":"http:\/\/www.cs.washington.edu\/research\/xmldatasets"},{"key":"29_CR15","unstructured":"http:\/\/www.alphaworks.ibm.com\/tech\/xmlgenerator"},{"key":"29_CR16","unstructured":"http:\/\/www.xmlfiles.com"}],"container-title":["Lecture Notes in Computer Science","Frontiers of WWW Research and Development - APWeb 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11610113_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T13:53:55Z","timestamp":1736171635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11610113_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311423","9783540324379"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11610113_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}