基于分布式B树编译的高效并发访问控制算法

发布时间：2018-02-28 03:16

本文关键词： 云计算云存储分布式访问　出处：《科技通报》2015年08期 　论文类型：期刊论文

【摘要】：在云计算环境中,根据数据的海量性和分布性特点,需要对云存储数据库进行访问控制。传统的访问控制算法采用散点信任评估的访问控制算法,融合云存储安全评估图进行均匀分布,当云存储节点分裂时导致数据访问性能不好。提出一种基于分布式B树编译的高效并发访问控制算法,根据访问服务器的数量,计算B树的高度和精度边界,查找缓冲的内部节点构成的B树,具有相同属性个数的边缘概念处于同一层,由此进行并发控制数据分类,对于包含有多个属性的类别,将其中的多个属性合并成一个属性,实现对云存储系统的高效并发访问控制。仿真实验表明,采用该算法,具有较小的CPU负载,明显提高了分布式B树的访问效率,并发访问控制精度较高,减轻服务器开销,提高数据访问能力,优化存储性能。
[Abstract]:In cloud computing environment, according to the characteristics of magnanimity and distribution of data, access control of cloud storage database is needed. When the cloud storage nodes split up, the data access performance is poor. An efficient concurrent access control algorithm based on distributed B-tree compilation is proposed, which is based on the number of access servers. The height and precision boundary of B-tree is calculated, and the B-tree composed of buffering internal nodes is found. The edge concept with the same number of attributes is in the same layer, and the concurrency control data is classified. Many of the attributes are merged into one attribute to realize the efficient concurrent access control of cloud storage system. The simulation results show that the algorithm has a smaller CPU load and improves the access efficiency of distributed B-tree obviously. The concurrency access control precision is high, reduces the server overhead, improves the data access ability, optimizes the storage performance.
【作者单位】：贵州工程应用技术学院;
【分类号】：TP333;TP309

【共引文献】