Abstract
A Permission Based Tree-Structured Approach for Replicated Databases
Highlights
A distributed database system (DDBS) is a system consisting of data items stored in a set of sites S_{1},S_{2},S_{3},...,S_{n} which communicate with each other by message passing via the underlying communication network
We have presented two efficient permission based algorithms for handling conflicting requests in replicated databases
By using the binary tree structured configuration of sites, we have reduced the number of messages required, and the network traffic by many folds
Summary
A distributed database system (DDBS) is a system consisting of data items stored in a set of sites S_{1},S_{2},S_{3},...,S_{n} which communicate with each other by message passing via the underlying communication network. One of the crucial strategies in a distributed database system is data replication. The crucial need for replicated databases is to maintain consistency and resolve conflicting requests. There may be a large number of conflicting requests. There is a need to efficiently handle conflicting requests such that only one site is updating data at a given point of time. Handling conflicting requests require messages to be passed between sites. It is imperative to reduce the number of messages to ensure that conflicts are handled without much latency
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
