{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T04:09:56Z","timestamp":1787717396912,"version":"build-2784847793"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319462943","type":"print"},{"value":"9783319462950","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46295-0_27","type":"book-chapter","created":{"date-parts":[[2016,9,19]],"date-time":"2016-09-19T13:21:04Z","timestamp":1474291264000},"page":"435-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["JSON Patch for Turning a Pull REST API into a Push"],"prefix":"10.1007","author":[{"given":"Hanyang","family":"Cao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-R\u00e9my","family":"Falleri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xavier","family":"Blanc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,20]]},"reference":[{"key":"27_CR1","unstructured":"Al-Ekram, R., Adma, A., Baysal, O.: diffX: an algorithm to detect changes in multi version XML documents. In: Processing of the CASCON 2005, pp. 1\u201311 (2005)"},{"issue":"1\u20133","key":"27_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337(1\u20133), 217\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Bryan, P., Nottingham, M.: JavaScript Object Notation (JSON) Patch. Technical report, RFC 6902, April 2013. http:\/\/www.hjp.at\/doc\/rfc\/rfc6902.html","DOI":"10.17487\/rfc6902"},{"key":"27_CR4","unstructured":"Buttler, D.: A short survey of document structure similarity algorithms. In: International Conference on Internet Computing, pp. 3\u20139 (2004)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Chawathe, S.S., Rajaraman, A., Garcia-Molina, H., Widom, J.: Change detection in hierarchically structured information. In: Jagadish, H.V., Mumick, I.S. (eds.) Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, 4\u20136 June 1996, pp. 493\u2013504. ACM Press (1996)","DOI":"10.1145\/235968.233366"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Cobena, G., Abiteboul, S., Marian, A.: Detecting changes in XML documents. In: Agrawal, R., Dittrich, K.R. (eds.) Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA, February 26\u2013March 1 2002, pp. 41\u201352. IEEE Computer Society (2002)","DOI":"10.1109\/ICDE.2002.994696"},{"key":"27_CR7","unstructured":"Crockford, D.: RFC4627: JavaScript Object Notation (2006)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Ellis, C.A., Gibbs, S.J.: Concurrency control in groupware systems. In: ACM SIGMOD Record, vol. 18, pp. 399\u2013407. ACM (1989)","DOI":"10.1145\/66926.66963"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/514183.514185","volume":"2","author":"RT Fielding","year":"2002","unstructured":"Fielding, R.T., Taylor, R.N.: Principled design of the modern Web architecture. ACM Trans. Internet Technol. (TOIT) 2(2), 115\u2013150 (2002). http:\/\/dl.acm.org\/citation.cfm?id=514185","journal-title":"ACM Trans. Internet Technol. (TOIT)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-32090-3_17","volume-title":"New Frontiers in Artificial Intelligence","author":"S Higuchi","year":"2012","unstructured":"Higuchi, S., Kan, T., Yamamoto, Y., Hirata, K.: An A* algorithm for computing edit distance between rooted labeled unordered trees. In: Okumura, M., Bekki, D., Satoh, K. (eds.) JSAI-isAI 2012. LNCS, vol. 7258, pp. 186\u2013196. Springer, Heidelberg (2012)"},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"DS Hirschberg","year":"1977","unstructured":"Hirschberg, D.S.: Algorithms for the longest common subsequence problem. J. ACM (JACM) 24(4), 664\u2013675 (1977)","journal-title":"J. ACM (JACM)"},{"issue":"7","key":"27_CR12","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Lindholm, T., Kangasharju, J., Tarkoma, S.: Fast and simple XML tree differencing by sequence alignment. In: Proceedings of the 2006 ACM Symposium on Document Engineering, DocEng 2006, pp. 75\u201384. ACM, New York (2006). http:\/\/doi.acm.org\/10.1145\/1166160.1166183","DOI":"10.1145\/1166160.1166183"},{"issue":"4","key":"27_CR14","first-page":"334","volume":"5","author":"M Pawlik","year":"2011","unstructured":"Pawlik, M., Augsten, N.: RTED: a robust algorithm for the tree edit distance. PVLDB 5(4), 334\u2013345 (2011)","journal-title":"PVLDB"},{"issue":"6","key":"27_CR15","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). http:\/\/dx.doi.org\/10.1137\/0218082","journal-title":"SIAM J. Comput."},{"issue":"3","key":"27_CR16","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. 42(3), 133\u2013139 (1992)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Service-Oriented Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46295-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T19:59:29Z","timestamp":1749585569000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-46295-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319462943","9783319462950"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46295-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"20 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSOC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Service-Oriented Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Banff","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icsoc2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}