{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:36:53Z","timestamp":1725496613961},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404569"},{"type":"electronic","value":"9783540450368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45036-x_74","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T12:33:07Z","timestamp":1196685187000},"page":"675-681","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Change Detection in Tree-Structured Data"],"prefix":"10.1007","author":[{"given":"Dong Ah","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suk-Kyoon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"74_CR1","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"S. M. Selkow","year":"1977","unstructured":"S. M. Selkow, \u201cThe tree-to-tree editing problem,\u201d Information Proc. Letters, 6, pp.184\u2013186, 1977.","journal-title":"Information Proc. Letters"},{"issue":"3","key":"74_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K. Tai","year":"1979","unstructured":"K. Tai, \u201cThe tree-to-tree correction problem,\u201d Journal of the ACM, 26(3), pp.422\u2013433, July 1979.","journal-title":"Journal of the ACM"},{"key":"74_CR3","doi-asserted-by":"crossref","unstructured":"S. Chawathe and H. G. Molina, \u201cMeaningful Change Detection in Structured Data,\u201d In Proc. of ACM SIGMOD\u2019 97, pp.26\u201337, 1997.","DOI":"10.1145\/253260.253266"},{"key":"74_CR4","unstructured":"Curbera and D. A. Epstein, \u201cFast Difference and Update of XML Documents,\u201d XTech\u2019 99, San Jose, March 1999."},{"key":"74_CR5","unstructured":"G. Cob\u00e9na, S. Abiteboul and A. Marian, \u201cDetecting Changes in XML Documents,\u201d The 18th ICDE, 2002."},{"key":"74_CR6","unstructured":"Y. Wang, D. J. DeWitt, J. Y. Cai, \u201cX-Diff: An Effective Change Detection Algorithm for XML Documents,\u201d To appear in the 19th ICDE, 2003."},{"key":"74_CR7","unstructured":"H. Maruyama, K. Tamura and N. Uramoto, \u201cDigest values for DOM(DOMHash) Proposal,\u201d IBM Tokyo Research Laboratory, 1998."},{"key":"74_CR8","doi-asserted-by":"crossref","unstructured":"R. Rivest, \u201cThe MD4 Message-Digest Algorithm,\u201d MIT and RSA Data Security, Inc., April 1992.","DOI":"10.17487\/rfc1320"},{"key":"74_CR9","unstructured":"Document Object Model (DOM) http:\/\/www.w3.org\/DOM\/"}],"container-title":["Lecture Notes in Computer Science","Web and Communication Technologies and Internet-Related Social Issues \u2014 HSI 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45036-X_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T13:19:57Z","timestamp":1557062397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45036-X_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404569","9783540450368"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45036-x_74","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}