Authors: Tomoya Enokido
Addresses: Faculty of Business Administration, Rissho University, Japan
Abstract: A Role-Based Access Control (RBAC) model is used to make a system secure. In addition to keeping systems secure, objects have to be consistent in the presence of multiple transactions. Traditional locking protocols and timestamp ordering schedulers are based on |first-comer-winner| and |timestamp order| principles to make multiple conflicting transactions serialisable, respectively. In this paper, we discuss concurrency control algorithms based on the significance of roles. We discuss a Role Ordering (RO) scheduler so that multiple conflicting transactions are serialisable in a significant dominant relation of roles. We evaluate the RO scheduler as compared with the Two-Phase Locking (2PL) protocol.
Keywords: role ordering schedulers; concurrency control; scheduling; conflicting transactions; locking protocols; serialisability; access control; timestamp ordering schedulers.
International Journal of High Performance Computing and Networking, 2007 Vol.5 No.1/2, pp.75 - 83
Published online: 14 Nov 2007 *Full-text access for editors Access for subscribers Purchase this article Comment on this article