DeepAI AI Chat
Log In Sign Up

Importing Relationships into a Running Graph Database Using Parallel Processing

05/05/2020
by   Joshua Porter, et al.
0

Importing relationships into a running graph database using multiple threads running concurrently is a difficult task, as multiple threads cannot write information to the same node at the same time. Here we present an algorithm in which relationships are sorted into bins, then imported such that no two threads ever access the same node concurrently. When this algorithm was implemented as a procedure to run on the Neo4j graph database, it reduced the time to import relationships by up to 69

READ FULL TEXT

page 1

page 2

page 3

page 4

06/29/2020

Parallel Betweenness Computation in Graph Database for Contingency Selection

Parallel betweenness computation algorithms are proposed and implemented...
02/08/2023

Detecting Data Type Inconsistencies in a Property Graph Database

Some property graph databases do not have a fixed schema, which can resu...
02/26/2018

In-database connected component analysis

We describe a Big Data-practical, SQL-implementable algorithm for effici...
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...
05/10/2019

Relationship Detection Measures for Binary SoC Data

System-on-Chip (SoC) designs are used in every aspect of computing and t...
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 ...