This is an extension of previous questions that I had posted (although no knowledge of them is needed to understand this).
Here's what the relations look like in my db... User1---VISITED PLACES---> Empty Node---->HAS VISITED----> Usa User2---VISITED PLACES---> Empty Node---->HAS VISITED----> Usa User1---VISITED PLACES---> Empty Node---->HAS VISITED----> Canada User2---VISITED PLACES---> Empty Node---->HAS VISITED----> Canada User1---VISITED PLACES---> Empty Node---->HAS VISITED----> India (The Usa nodes are the same one). Each user has his/her own VISITED PLACES empty node (so that the point from where all these relations emerge are centralized). User1 and User2 are friends. Now, as User1 and User2 have most of their visited places common, I want to generate suggestions of places (here India) where User2 can visit (based upon the places where User2's friends have visited)... How can I do that? Any suggestions regarding the same? Indexing or Traversals?? _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
