Title: Security access control method of heterogeneous database based on K-shortest path algorithm

Authors: Wenting Zhou; Maohua Yao

Addresses: Department of Civil and Surveying Engineering, Guilin University of Technology at Nanning, Nanning, 530000, China ' Natural Resources Information Center of Guangxi Zhuang Autonomous Region, Nanning, 530000, China

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.

Keywords: K-shortest path algorithm; heterogeneous database; security access; entropy weight method; authorisation path.

DOI: 10.1504/IJRIS.2024.138628

International Journal of Reasoning-based Intelligent Systems, 2024 Vol.16 No.2, pp.170 - 177

Received: 18 Oct 2022
Accepted: 27 Apr 2023
Published online: 18 May 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article