neo4j-contrib/neo4j-apoc-procedures

automatic substructure dense nodes

Open

#614 opened on Sep 29, 2017

View on GitHubContributor guide
 (0 comments) (0 reactions) (0 assignees)Java (498 forks)github user discovery
enhancementextended-functionalitygood first issuehelp-wanted

Repository metrics

Stars
 (1,869 stars)
PR merge metrics
 (Avg merge 4d 2h) (1 merged PR in 30d)

Description

Add procedures to automatically create and update multi-level trees for multi-million relationship-dense nodes to reduce read and write contention.

Procedures

  • apoc.dense.create.relationship(n1,type,props,n2)
  • apoc.dense.delete.relationship(n1,type,props,n2)

Function/Procedure

  • apoc.dense.relationships(n1,type[,props],level/count)

create a tree with levels that will be filled with (1k,10k relationships per tree-node (and another 100-1k relationships to the next level of tree-nodes) and if it is full, a new level is added, where the next n relationships will be sent to).

million-rel-substructure-1

Contributor guide

Research direction
Study the existing APOC dense node procedures, understand the tree structure algorithm, then implement the create/delete/query procedures for multi level trees.
Tech stack
java
Domain
database
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
4
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Over 1 week
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Needs investigation
Prerequisites
Neo4jJavaAPOC procedures
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
20