# Importing Relationships into a Running Graph Database Using Parallel Processing

arXiv: https://arxiv.org/abs/2005.04093 · HTML: https://mlsanity.com/paper/2005.04093/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 5 May 2020.

## Built on by (most cited first, 1 of 1)

- [From SQL to Knowledge Graphs: An LLM-Driven Multi-Agent Approach with Data Schema Improvement](https://mlsanity.com/paper/2608.26117/) (2026)

## Abstract (arXiv)

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% when 32 threads were used.