Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Replication, consistency, and practicality: are these mutually exclusive?
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Update propagation protocols for replicated databates
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Deferred Updates and Data Placement in Distributed Databases
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Improving the Scalability of Fault-Tolerant Database Clusters
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Comparison of UDDI Registry Replication Strategies
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Web Services: Concepts, Architectures and Applications
Web Services: Concepts, Architectures and Applications
Tree-Based Dynamic Primary Copy Algorithms for Replicated Databases
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Exploiting Synergies between Coexisting Overlays
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Hi-index | 0.00 |
As the community using web services grows, the UDDI registry is a crucial entry point that needs to provide high throughput, high availability and access to accurate data. Replication is often used to satisfy such requirements. In this paper, we propose dynamic primary copy method, a variant of primary copy method to handle the replicated UDDI registry, and two algorithms implementing this method. In this method, the update is done at the site where the request is submitted. The algorithms use a simple mechanism to handle the conflicting requests on UDDI entities in an efficient fashion. Due to a large volume of update and inquiry requests to UDDI, the number and size of the messages are critical in any replication solution for UDDI registry. Our algorithms reduce both the number and the size of messages significantly. The main difference between the two algorithms is that one of the algorithms handles high degree of conflicting update requests in an efficient fashion without transmitting unnecessary intermediate results.