Patent attributes
Enterprise applications need to store and evaluate permissions on per User, per Entity and per Action basis for hundreds of Users and thousands of permissions. Most of the times this data takes up to 5 database tables to store the Role Based Access Control (RBAC) permissions. Selecting permissions for user from database consumes time while any User attempts to perform any Action. Sometimes the time taken to check permission is more than time taken to perform the required Action. Thus the current approaches for RBAC are inefficient in all—computation TIME, runtime MEMORY and database STORAGE. Binary arithmetic is known for being vast in scalability, smallest in memory and fastest in speed. This paper describes a new method which uses binary data structure and binary arithmetic to accurately check User permissions. We also claim that this method is the most scalable and fastest possible for Role Based Access Control.
