I am working on a project (platform) where I am using neo4j to make connections between users. There are following different ways where user can connect to other users on the platform.
1. When a user logs in with Facebook, I get his mutual friends who are already using our platform. There I make a connection in my graph database by creating a new node (current user) and make connections with all existing nodes whom he knows through facebook. 2. One user also connects with other user if both are staying in same society/community. So the use case is, once a user updates his residential address (society name, city) than I make a query in graph db and get all nodes who also stay in the same society and create this new user with those nodes with relationship name "Same society". 3. Same was user might be connected with other user if both users study in same college or school. I make a connection between two nodes with relationship "Same college/school". My question is that what is the best way to model above problem in neo4j. And if I do a query in DB to get all the relationship types and shortest path of all the relationships between given two nodes. In which model this kind of query will be optimized. Thanks, Anshul Founder: www.rentomo.com -- 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 [email protected]. For more options, visit https://groups.google.com/d/optout.
