chim3yy
Node Link
since ā€Ž09-25-2019
ā€Ž06-01-2022

User Statistics

  • 14 Posts
  • 1 Solutions
  • 6 Kudos given
  • 1 Kudos received

User Activity

Hello, I have this huge graph dataset loaded to Neo4j and I needed to project the whole graph to check for its weakly connected component. Is there are procedures or a standard way to delete the nodes so that I can reduce the size of the graph?
Hello, I have already tried uninstalling/installing, deleting all the related files but, I still cannot start a new database when I reinstall the fresh version of the Neo4j Desktop. Your support will be truly helpful in this regard. Here is my log: [...
Suppose, we want to search for (1)-[edgeA]-(2)-[edgeB]-(3) efficiently where (1), (2) and (3) are nodes and we have two edges connecting between them [edgeA], [edgeB]. I came across this work: Path indexing for efficient path query processing in grap...
Suppose, we want to implement indexing structure such as quad-tree for instance, on Neo4j how can get started?
Hello, can someone kindly suggest me books/paper/benchmark report which mentions regarding: Problem: suppose we have dataset S={r1, r2, r3,r4,r5} and we want to find node similarity such as {cos(r1,r2), cos(r1, r3), cos(r1, r4), Cos(r2, r3), Cos(r2,r...