{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T05:17:14Z","timestamp":1739078234373,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922940"},{"type":"electronic","value":"9783540922957"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92295-7_43","type":"book-chapter","created":{"date-parts":[[2009,3,25]],"date-time":"2009-03-25T08:00:00Z","timestamp":1237968000000},"page":"362-367","source":"Crossref","is-referenced-by-count":0,"title":["Tree-Based Dynamic Primary Copy Algorithms for Replicated Databases"],"prefix":"10.1007","author":[{"given":"Pradhan Bagur","family":"Umesh","sequence":"first","affiliation":[]},{"given":"A. R.","family":"Bharath Kumar","sequence":"additional","affiliation":[]},{"given":"V. S.","family":"Ananthanarayana","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Sun, C., Lin, Y., Kemme, B.: Comparison of UDDI Registry Replication Strategies. In: ICWS 2004, pp. 218\u2013225 (2004)","key":"43_CR1","DOI":"10.1109\/ICWS.2004.1314742"},{"unstructured":"Wolski, A.: Applying Replication to Data recharging in Mobile Systems. Solid Information Technology\u00a07(2) (2001)","key":"43_CR2"},{"unstructured":"Breitbart, Y., Komondoor, R., Rastogi, R., Seshadri, S.: Update Protocols for Replicated Database. In: ICDE, pp. 469\u2013476 (1996)","key":"43_CR3"},{"doi-asserted-by":"crossref","unstructured":"Anderson, T.A., Breibart, Y., Korth, H.F., Wool, A.: Replication, Consistancy and Pratcality: Are these Mutually Exclusive? In: ACM SIGMOD 1998, pp. 485\u2013495 (1998)","key":"43_CR4","DOI":"10.1145\/276304.276347"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/11951957_34","volume-title":"Distributed Computing and Internet Technology","author":"V.S. Ananthanarayana","year":"2006","unstructured":"Ananthanarayana, V.S., Vidyasankar, K.: Dynamic Primary Copy with Piggy-Backing Mechanism for Replicated UDDI Registry. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds.) ICDCIT 2006. LNCS, vol.\u00a04317, pp. 389\u2013402. Springer, Heidelberg (2006)"},{"unstructured":"Bharath Kumar, A.R., Pradhan, B.U., Ananthanarayana, V.S.: An Efficient Lazy Dynamic Primary Copy Algorithm for Replicated UDDI Registry. In: ICIP 2008, pp. 564\u2013571 (2008)","key":"43_CR6"},{"unstructured":"Pradhan, B.U., Bharath Kumar, A.R., Ananthanarayana, V.S.: An Efficient Eager Dynamic Primary Copy Algorithm for Replicated UDDI Registry. In: ICCNS 2008, pp. 161\u2013166 (2008)","key":"43_CR7"},{"issue":"1","key":"43_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed Mutual Exclusion. ACM Transactions on Computer Systems\u00a07(1), 61\u201377 (1989)","journal-title":"ACM Transactions on Computer Systems"},{"doi-asserted-by":"crossref","unstructured":"Lamport, L.: Time, Clocks and the ordering of Events in a Distributed System. Communications of the ACM, 558\u2013565 (1978)","key":"43_CR9","DOI":"10.1145\/359545.359563"},{"doi-asserted-by":"crossref","unstructured":"Huang, Y., Wolfson, O.: A Competitive Dynamic Data Replication Algorithm. In: Proceedings of the Ninth International Conference on Data Engineering, April 1993, pp. 310\u2013317 (1993)","key":"43_CR10","DOI":"10.1109\/ICDE.1993.344051"},{"doi-asserted-by":"crossref","unstructured":"Revannaswamy, V., Bhatt, P.C.P.: A Fault Tolerant Protocol as an Extension to a Distributed Mutual Exclusion Algorithm. In: ICPADS 1997, p. 730 (1997)","key":"43_CR11","DOI":"10.1109\/ICPADS.1997.652623"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92295-7_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T17:26:18Z","timestamp":1739035578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92295-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922940","9783540922957"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92295-7_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}