An RBAC Optimization Algorithm Based on Multiplication Bitmap

Abstract

The invention relates to the field of data processing and computing, and discloses an RBAC optimization algorithm based on a multiplication bitmap. The number of digits of the permission number and the number of digits of the permission identifier are used to calculate the multiplication factor of the permission owned by the role; each digit of the permission identifier corresponds to the permission number in turn, and the permission identifier associated with each multiplication factor is converted into the corresponding permission bit Figure; obtain the multiplication bitmap based on the multiplication factor and the permission bitmap, and store the multiplication bitmap to the database. The technical solution of the present invention occupies a small storage space, the data processing logic is simple and efficient, and the authority query efficiency is high.

Description

technical field [0001] The invention relates to the field of data processing and computing, in particular to an RBAC optimization algorithm based on a multiplication bitmap. Background technique [0002] In the traditional role-based permission control (RBAC) storage method, the relationship between roles and permissions (functions) is stored in the table records of the relational database. This storage method in the prior art has the following problems: [0003] (1) Large storage space occupation: In the traditional method, a role-permission relationship uses a table record, and each role-permission relationship record occupies about 64 bits (32 bits of role number + 32 bits of permission number), and each role-permission relationship All need to be stored, and a large amount of redundant data needs to be saved; [0004] (2) The expansion operation is cumbersome: in the traditional method, if new permissions are added, a large number of role permission relationship records...

AI Technical Summary

Problems solved by technology

[0003] (1) Large storage space: In the traditional method, a role-permission relationship uses a table record, and each role-permission relationship record occupies about 64 bits (role number 32 bits + permission number 32 bits), and each role-permission relationship record Both need to be stored, and a large amount of redundant data needs to be saved;

[0004] (2) The expansion operation is cumbersome: in the traditional method, if new permissions are added, a large number of role permission relationship records need to be initialized, and the operation is cumbersome;

[0005] (3) In the traditional method, when querying the permissions owned by a role, all permissions and role relationship records need to be filtered, and the query efficiency is low

Images