Parallel Betweenness Computation in Graph Database for Contingency Selection

06/29/2020
by   Yongli Zhu, et al.
0

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.

READ FULL TEXT
research
03/15/2018

CIM/E Oriented Graph Database Model Architecture and Parallel Network Topology Processing

CIM/E is an easy and efficient electric power model exchange standard be...
research
05/05/2020

Importing Relationships into a Running Graph Database Using Parallel Processing

Importing relationships into a running graph database using multiple thr...
research
04/07/2019

Fast Grid Splitting Detection for N-1 Contingency Analysis by Graph Computing

In this study, a graph-computing based grid splitting detection algorith...
research
09/05/2018

Exploration of Bi-Level PageRank Algorithm for Power Flow Analysis Using Graph Database

Compared with traditional relational database, graph database, GDB, is a...
research
03/08/2018

Exploration of Graph Computing in Power System State Estimation

With the increased complexity of power systems due to the integration of...
research
02/07/2023

Two Parallel PageRank Algorithms via Improving Forward Push

Initially used to rank web pages, PageRank has now been applied in many ...
research
09/05/2018

Power Flow Analysis Using Graph based Combination of Iterative Methods and Vertex Contraction Approach

Compared with relational database (RDB), graph database (GDB) is a more ...

Please sign up or login with your details

Forgot password? Click here to reset