论文标题
图形数据库中的平行中度计算用于偶然性选择
Parallel Betweenness Computation in Graph Database for Contingency Selection
论文作者
论文摘要
在图形数据库中提出并实现了平行的中间计算算法，以进行电源系统应急选择。研究了图数据库和图计算的原理，以进行节点和边缘中的计算。 118-BUS系统和真实电源系统上的实验表明，由于节点和边缘相互计算，可以实现速度，而后者对后者的速度效应更为显着，这是由于图形数据库在电源网络数据上的数据优势而变得更加显着。
Parallel betweenness computation algorithms are proposed and implemented in a graph database for power system contingency selection. Principles of the graph database and graph computing are investigated for both node and edge betweenness computation. Experiments on the 118-bus system and a real power system show that speed-up can be achieved for both node and edge betweenness computation while the speeding effect on the latter is more remarkable due to the data retrieving advantages of the graph database on the power network data.
