Abstract

Many real time applications required data services in distributed environment. In distributed real time database system (DRTDBS), all the transactions have special characteristics of timing constraints. It is very difficult to complete these transactions before the deadline. Transactions that miss their deadlines are just destroyed and rejected by the system. For better performance, proper management of transaction is essential. In this paper a priority based sub transaction management with beetle swarm optimization is used for finding the highest priority cohorts. Priority is determined by means of the quantity of write locks and the size of data items. The proposed method improves the performance of DRTDBS by reducing miss rate. The performance of the introduced system in terms of miss rate and data conflict is evaluated with the previous priority management methods.

Full Text
Paper version not known

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