More recursion than I expected

[David Rader]

Followed a set of "tree" instructions to build a time tree.

The command responses were all as expected during the build process.

And, the node counts are correct:

2 Century (20 and 21)

200 Years

2400 Months

73049  Days =200*365 + (25 * 2) Leapyear 2/29s - the one 2/29 for 1900 (not a Leapyear)

In the table form of the apoc.meta.graph output, there are three relationships with the type PART_OF and each has the expected count of 75649 = 73049 + 2400 +200.  Obviously, only expected one. But, there are three layers (C to Y, Y to M and M to D).

Consequently the apoc.meta.graph shows more relationships than expected. Is this an artifact of walking all the edges in the graph or did I mess up in the Merge commands on the relationships?

Would appreciate help on what I misunderstood in the building process and a recommendation on how to fix. As a newbie, my attempts at finding the redundant PART_OF relations always returned NO ROWS. So, I need to learn the best pattern for the recursion.

Many thanks

Dave

[David Rader]

This was also noted by two others on stack overflow.  Appears to be an issue with the apoc.meta.graph output.  A fix is posted on stack overflow if the apoc result is important. The underlying source graphdb may be just fine.

[Michael Hunger]

The reason is that meta graph uses db statistics. 

But those are not sufficiently detailed so additional relationships are inferred. 

Fixed it by sampling and checking potentially wrong relationships 

In 3.1.0.3 and the to be released 3.0.4.2

Von meinem iPhone gesendet

--
You received this message because you are subscribed to the Google Groups "Neo4j" group.
To unsubscribe from this group and stop receiving emails from it, send an email to neo4j+un...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.