Concurrency control using role ordering (RO) scheduler

Role-based access control (RAC) models are widely used, to keep systems secure. In order to keep systems consistent, locking protocols and timestamp ordering schedulers are adopted, which, are based on principles "first-comer-winner" and "timestamp order\´\´ to make multiple conflicting transactions serializable, respectively. In this paper, we discuss concurrency control algorithms based, on the role concept. We first define a. significantly dominant relation on roles showing which one of a pair of roles is more significant than the other role. We discuss a role ordering (RO) scheduler based, on the role concept. We evaluate the RO scheduler compared with the two-phase locking (2PL) protocol in terms of throughput and waiting time.