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.
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 callMore From: International Journal of High Performance Computing and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
