基于回溯搜索的电力时序数据库集群拓展方法  

Cluster expansion method of power time series database based on backtracking search

作　　者：刘文亮 郭敬东 吴飞 何德明 林少钧 LIU Wenliang;GUO Jingdong;WU Fei;HE Deming;LIN Shaojun(State Grid Fujian Electric Power Co.,Ltd.,Fuzhou 350003,China)

机构地区：[1]国网福建省电力有限公司,福建福州350003

出　　处：《电子设计工程》2024年第12期96-99,108,共5页Electronic Design Engineering

摘　　要：现有的电力时序数据库集群拓展方法拓展响应时间较低,导致集群效率较差,因此基于回溯搜索研究了一种新的电力时序数据库集群拓展方法。通过数据库集群搜索拓扑结构的邻接矩阵,计算电力数据库中关联性较高的数据拓扑结构,直接明确数据搜索的目标,缩小数据搜索可确定的范围。针对搜索拓扑内的电力数据,采用回溯搜索算法中的分层回溯原则,为数据库集群内数据搜索行为增加约束条件。根据开关矩阵判断数据节点之间的关系,实现电力时序数据库的集群拓展。实验结果表明,基于回溯搜索的电力时序数据库集群拓展方法的拓展响应时间低于0.5 s,集群效率在98%以上。Because of the low response time of the existing power sequence database cluster expansion methods,the efficiency of the cluster is poor,so a new power sequence database cluster expansion method based on backtracking search is studied.The adjacency matrix of the topology structure is searched by the database cluster,and the highly related data topology structure in the power database is calculated,so as to directly define the target of data search and narrow the scope of data search.For the power data in the search topology,the hierarchical backtracking principle in the backtracking search algorithm is adopted to add constraints to the data search behavior in the database cluster.According to the switch matrix,the relationship between data nodes is judged,and the cluster expansion of power timing database is realized.The experimental results show that the response time of the cluster expansion method of power time series database based on backtracking search is less than 0.5 s,and the cluster efficiency is more than 98%.

关 键 词：回溯搜索 电力时序数据 数据库集群 集群拓展 邻接矩阵 

分 类 号：TN01[电子电信—物理电子学]