Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/6843Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Umesh, P.B. | - |
| dc.contributor.author | Bharath, Kumar, A.R. | - |
| dc.contributor.author | Ananthanarayana, V.S. | - |
| dc.date.accessioned | 2020-03-30T09:46:14Z | - |
| dc.date.available | 2020-03-30T09:46:14Z | - |
| dc.date.issued | 2009 | - |
| dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2009, Vol.5408 LNCS, , pp.362-367 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/6843 | - |
| dc.description.abstract | With increasing demand for performance, availability and fault tolerance in databases, data replication is gaining more and more importance. Resolving or serializing conflicting update requests is the main challenge in large scale deployment of replicated databases. In this paper, we propose the first token based dynamic primary copy algorithms for resolving conflicting requests among different sites of replicated databases. The contribution being reduction in the number of messages required per update request. � 2009 Springer. | en_US |
| dc.title | Tree-based dynamic primary copy algorithms for replicated databases | en_US |
| dc.type | Book chapter | en_US |
| Appears in Collections: | 2. Conference Papers | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.