论文标题
使用并行处理将关系导入运行的图形数据库
Importing Relationships into a Running Graph Database Using Parallel Processing
论文作者
论文摘要
使用多个线程同时运行的多个线程将关系导入运行的图形数据库是一个困难的任务，因为多个线程不能同时将信息写入同一节点。在这里，我们提出了一种算法，其中关系被整理成垃圾箱，然后导入，因此没有两个线程同时访问相同的节点。当将该算法作为在NEO4J图数据库上运行的过程时，当使用32个线程时，将其导入关系的时间最多减少了69％。
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.
