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

Abstract

Compared with traditional relational database, graph database, GDB, is a natural expression of most real-world systems. Each node in the GDB is not only a storage unit, but also a logic operation unit to implement local computation in parallel. This paper firstly explores the feasibility of power system modeling using GDB. Then a brief introduction of the PageRank algorithm and the feasibility analysis of its application in GDB are presented. Then the proposed GDB based bilevel PageRank algorithm is developed from PageRank algorithm and Gauss Seidel methodology realize high performance parallel computation. MP 10790 case, and its extensions, MP 107900 and MP 1079000, are tested to verify the proposed method and investigate its parallelism in GDB. Besides, a provincial system, FJ case which include 1425 buses and 1922 branches, is also included in the case study to further prove the proposed algorithm effectiveness in real world.

7 pages, 6 figures, 3 tables, 2018 IEEE International Congress on Big Data. arXiv admin note: text overlap with arXiv:1809.01398

References in corpus (6)

• Co-Optimization Scheme for Distributed Energy Resource Planning in Community Microgrids
• Security Constrained Multi-Stage Transmission Expansion Planning Considering a Continuously Variable Series Reactor
• Exploration of Graph Computing in Power System State Estimation
• Graph Based Power Flow Calculation for Energy Management System
• Economic Sizing of Distributed Energy Resources for Reliable Community Microgrids
• Graph based Platform for Electricity Market Study, Education and Training