Concurrency control based on role concept
by Tomoya Enokido
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 5, No. 1/2, 2007

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.

Online publication date: Wed, 14-Nov-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email