Concurrency control based on role concept. (15th November 2007)

• Record Type: Journal Article
• Authors: Enokido, Tomoya
• Is Part Of: International journal of high performance computing and networking. Volume 5:Number 1/2(2007)
• Page Start: 75
• Page End: 83
• Publication Date: 2007-11-15
• Subjects: role ordering schedulers -- concurrency control -- scheduling -- conflicting transactions -- locking protocols -- serialisability -- access control -- timestamp ordering schedulers; High performance computing -- Periodicals; Computer networks -- Periodicals; High performance computing; Periodicals; 004.05
• Languages: English
• ISSNs: 1740-0562

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.