Importing Relationships into a Running Graph Database Using Parallel Processing

May 05, 2020 · Entered Twilight · 🏛 arXiv.org

🌅 TWILIGHT: Old Age
Predates the code-sharing era — a pioneer of its time

"Last commit was 5.0 years ago (≥5 year threshold)"

Evidence collected by the PWNC Scanner

Repo contents: BinSet.java, GroupIterator.java, IterateRelationship.java, LICENSE, README.md, erdosRenyi.jar, insert_nodes_rels.cql, iterateRelationship.md, iterateRelationship_latest.jar

Authors Joshua Porter, Aleks Ontman arXiv ID 2005.04093 Category cs.DC: Distributed Computing Cross-listed cs.PF Citations 1 Venue arXiv.org Repository https://github.com/Lnofeisone/graph-iterateRelationship ⭐ 3 Last Checked 2 months ago
Abstract
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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 💻 Repository 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Distributed Computing