检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘晓梅[1] 董仲博 LIU Xiaomei;DONG Zhongbo(Department of Information Engineering,Yantai Vocational College,Yantai 264000,Shandong China;Shandong Institute of Aerospace Electronics Technology,Yantai 264000,Shandong China)
机构地区:[1]烟台职业学院信息工程系,山东烟台264000 [2]山东航天电子技术研究所,山东烟台264000
出 处:《吉首大学学报(自然科学版)》2024年第1期36-41,共6页Journal of Jishou University(Natural Sciences Edition)
摘 要:为了解决分布式数据库索引查询负载不平衡的问题,基于一致性哈希算法设计了分布式数据库索引查询优化方法.根据分布式数据库服务器节点CPU处理能力、带宽和缓存大小,采用动态反馈机制计算各服务器节点的索引查询负载率,通过一致性哈希负载平衡算法将任务分配给各服务器节点,并实时调整负载.以最小总代价为目标,利用多蚁群算法求得最佳查询路径.实验结果显示,基于一致性哈希算法的优化方法整体曲线趋势较平稳,在用户请求数量为4 000条时,最大负载平衡度为1.5%,全程响应时间小于35 ms.这说明该方法能够有效调整分布式数据库的负载分布,且受数据库规模影响较小,具备强大的查询响应能力.In order to solve the problem of imbalanced load in distributed database index queries,a distributed database index query optimization method is designed based on consistent hashing algorithm.Based on the CPU processing capacity,bandwidth,and cache size of distributed database server nodes,a dynamic feedback mechanism is used to calculate the index query load rate of each server node.A consistent hash load balancing algorithm is used to allocate tasks to each server node and adjust the load in real time.Multiple ant colony algorithms is used to find the optimal query path with the goal of minimizing the total cost.The experimental results show that the optimization method based on consistent hashing algorithm is stable and can reduce the load balancing degree to 1.5%when the number of user requests is 4000,with a full response time of less than 35 ms.This indicates that this method can effectively adjust the load distribution of distributed databases,is less affected by database size,and has strong query response capabilities.
关 键 词:一致性哈希 索引查询 分布式数据库 负载平衡 多蚁群算法 学习算子
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.150.27