Security access control method of heterogeneous database based on K-shortest path algorithm Online publication date: Sat, 18-May-2024
by Wenting Zhou; Maohua Yao
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 16, No. 2, 2024
Abstract: In order to improve access control accuracy and reduce control time, a secure access control method for heterogeneous databases based on the K-shortest path algorithm is proposed. Heterogeneous databases are registered, user behaviours are monitored, and evidence of user behaviour through users' access to logs of heterogeneous databases is obtained. After dimensionless processing of the behaviour evidence, the entropy weight method is used to calculate the user trust rating. According to the rating results, the security access secret key of heterogeneous databases is generated from both on chain and off chain aspects for permission allocation. Build a security access control model for heterogeneous databases. Based on the K-shortest path algorithm with Dijkstra as the core, find the K-shortest path, obtain the authorisation path for security access control of heterogeneous databases, and achieve security access control. The experimental results show that the proposed method has higher control accuracy and shorter control time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and 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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook