These changes use Neo4j as the database backend to store the tree as a native graph, which for querying performance has an exponential speedup in finding nodes based on relationships.
Insertion performance however is not as great, and I'm still working on increasing node insertion throughput into neo4j, but I think more time investment during the initial processing stage to save query time aligns with the project goal more.
These changes use Neo4j as the database backend to store the tree as a native graph, which for querying performance has an exponential speedup in finding nodes based on relationships.
Insertion performance however is not as great, and I'm still working on increasing node insertion throughput into neo4j, but I think more time investment during the initial processing stage to save query time aligns with the project goal more.