{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:07:34Z","timestamp":1725494854252},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755623"},{"type":"electronic","value":"9783540755630"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75563-0_39","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T07:07:07Z","timestamp":1194937627000},"page":"582-598","source":"Crossref","is-referenced-by-count":10,"title":["A Fine-Grained XML Structural Comparison Approach"],"prefix":"10.1007","author":[{"given":"Joe","family":"Tekli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Chbeir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kokou","family":"Yetongnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321921.321922","volume":"23","author":"A. Aho","year":"1976","unstructured":"Aho, A., Hirschberg, D., Ullman, J.: Bounds on the Complexity of the Longest Common Subsequence Problem. Association for Computing Machinery\u00a023(1), 1\u201312 (1976)","journal-title":"Association for Computing Machinery"},{"key":"39_CR2","first-page":"23","volume":"29","author":"E. Bertino","year":"2004","unstructured":"Bertino, E., Guerrini, G., Mesiti, M.: A Matching Algorithm for Measuring the Structural Similarity between an XML Documents and a DTD and its Applications. Elsevier Computer Science\u00a029, 23\u201346 (2004)","journal-title":"Elsevier Computer Science"},{"key":"39_CR3","volume-title":"Proc. of the ACM SIGMOD 1996","author":"S. Chawathe","year":"1996","unstructured":"Chawathe, S., Rajaraman, A., Garcia-Molina, H., Widom, J.: Change Detection in Hierarchically Structured Information. In: Proc. of the ACM SIGMOD 1996, ACM Press, New York (1996)"},{"unstructured":"Chawathe, S.: Comparing Hierarchical Data in External Memory. In: VLDB 1999, pp. 90\u2013101 (1999)","key":"39_CR4"},{"key":"39_CR5","first-page":"41","volume-title":"Proc. of the IEEE Int. Conf. on Data Engineering","author":"G. Cob\u00e9na","year":"2002","unstructured":"Cob\u00e9na, G., Abiteboul, S., Marian, A.: Detecting Changes in XML Documents. In: Proc. of the IEEE Int. Conf. on Data Engineering, pp. 41\u201352. IEEE Computer Society Press, Los Alamitos (2002)"},{"issue":"3","key":"39_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.is.2004.11.009","volume":"31","author":"T. Dalamagas","year":"2006","unstructured":"Dalamagas, T., Cheng, T., Winkel, K., Sellis, T.: A methodology for clustering XML documents by structure. Information Systems\u00a031(3), 187\u2013228 (2006)","journal-title":"Information Systems"},{"unstructured":"Flesca, S., Manco, G., Masciari, E., Pontieri, L., Pugliese, A.: Detecting Structural Similarities Between XML Documents. In: Proc. of 5th SIGMOD Workshop on The Web and Databases (2002)","key":"39_CR7"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.2307\/2346439","volume":"18","author":"J.C. Gower","year":"1969","unstructured":"Gower, J.C., Ross, G.J.S.: Minimum Spanning Trees and Single Linkage Cluster Analysis. Applied Statistics\u00a018, 54\u201364 (1969)","journal-title":"Applied Statistics"},{"doi-asserted-by":"crossref","unstructured":"Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate XML Joins. In: Proceedings of ACM SIGMOD 2002, pp. 287\u2013298 (2002)","key":"39_CR9","DOI":"10.1145\/564691.564725"},{"doi-asserted-by":"crossref","unstructured":"Halkidi, M., Batistakis, Y., Vazirgiannis, M.: Clustering Algorithms and Validity Measures. In: SSDBM Conference, Virginia, USA (2001)","key":"39_CR10","DOI":"10.1109\/SSDM.2001.938534"},{"key":"39_CR11","first-page":"707","volume":"6","author":"V. Levenshtein","year":"1966","unstructured":"Levenshtein, V.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Sov. Phys. Dokl.\u00a06, 707\u2013710 (1966)","journal-title":"Sov. Phys. Dokl."},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"E. Myers","year":"1986","unstructured":"Myers, E.: An O(ND) Difference Algorithm and Its Variations. Algorithmica\u00a01, 251\u2013266 (1986)","journal-title":"Algorithmica"},{"unstructured":"Nierman, A., Jagadish, H.V.: Evaluating structural similarity in XML documents. In: Proceedings of the 5th SIGMOD Workshop on The Web and Databases (2002)","key":"39_CR13"},{"key":"39_CR14","volume-title":"Information Retrieval","author":"C.J. Rijsbergen van","year":"1979","unstructured":"van Rijsbergen, C.J.: Information Retrieval. Butterworths, London (1979)"},{"key":"39_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/11547273_14","volume-title":"Xsym\u201905","author":"I. Sanz","year":"2005","unstructured":"Sanz, I., Mesiti, M., Guerrini, G., Berlanga Lavori, R.: Approximate Subtree Identification in Heterogeneous XML Documents Collections. In: Bressan, S., Ceri, S., Hunt, E., Ives, Z.G., Bellahs\u00e8ne, Z., Rys, M., Unland, R. (eds.) XSym 2005. LNCS, vol.\u00a03671, pp. 192\u2013206. Springer, Heidelberg (2005)"},{"unstructured":"Schlieder, T.: Similarity Search in XML Data Using Cost-based Query Transformations. In: Proceedings of 4th SIGMOD Workshop on The Web and Databases (2001)","key":"39_CR16"},{"key":"39_CR17","volume-title":"Pattern Matching in Strings, Trees and Arrays","author":"D. Shasha","year":"1995","unstructured":"Shasha, D., Zhang, K.: Approximate Tree Pattern Matching. In: Pattern Matching in Strings, Trees and Arrays, ch. 14, Oxford University Press, Oxford (1995)"},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"J. Wagner","year":"1974","unstructured":"Wagner, J., Fisher, M.: The String-to-String correction problem. ACM J.\u00a021, 168\u2013173 (1974)","journal-title":"ACM J."},{"issue":"1","key":"39_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/321921.321923","volume":"23","author":"C. Wong","year":"1976","unstructured":"Wong, C., Chandra, A.: Bounds for the String Editing Problem. ACM J.\u00a023(1), 13\u201316 (1976)","journal-title":"ACM J."},{"unstructured":"WWW Consortium, The Document Object Model, \n                    \n                      http:\/\/www.w3.org\/DOM","key":"39_CR20"},{"issue":"6","key":"39_CR21","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. of Computing\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM J. of Computing"},{"unstructured":"Zhang, Z., Li, R., Cao, S., Zhu, Y.: Similarity Metric in XML Documents. In: Knowledge Management and Experience Management Workshop (2003)","key":"39_CR22"}],"container-title":["Lecture Notes in Computer Science","Conceptual Modeling - ER 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75563-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T05:47:24Z","timestamp":1551073644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75563-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540755623","9783540755630"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75563-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}