Hi,
I'm trying to use neo4j to work out what the most popular routes are through
our
web site that result in users registering.
I have Visitor nodes related with multiple Visit nodes. Each Visit is then
related with multiple Page nodes by a relationship VISITED_STEP which indicates
when the Visitor went to that Page in their visit, e.g. step 0 = the first page
visited, 1 = the next, etc.
The algorithm I need will let me start at the registration page, and then
traverse outwards. The next node it should visit would be the one with the
greatest total number of incoming VISIT_STEP relationships. This node will be
added to a data structure for later retrieval. From there, it should move on to
the next node that has the greatest total number of incoming VISIT_STEP
relationships, and again add the node to a data structure.
Is there any way I can write a ReturnableEvaluator that can examine the
collection of nodes related to the current node? Is this even the correct
approach?
I actually want to be able to return the 10 most popular routes to the
registration page. For the most popular, I can use the above algorithm, but for
the second it's going to be more tricky.
Would I be able to search for all 10 routes in a single pass, or should I
perform multiple passes?
Any help would be really appreciated since I'm not really sure how to approach
this.
Thanks,
Tim
_______________________________________________
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
