图数据库中权变选择的介数并行计算
Parallel Betweenness Computation in Graph Database for Contingency Selection
摘要：
提出了一种用于电力系统事故选择的并行介数计算算法，并在图数据库中实现。图数据库和图计算的原则进行了研究的节点和边介数计算。在118节点系统和实际电力系统上的实验表明，该算法对节点介数和边介数的计算都有一定的加速效果，但由于图形数据库对电网数据的数据检索优势，对边介数的加速效果更为显著。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
