Hello, I am currently researching a migration from MySQL to Neo4j for a journey planner my agency has built for a local bus operator. Due to scaling and performance issues we are looking to migrate to a NoSQL (preferably graph-based) solution.
Two of my tests so far, in Gremlin and using traversals have been successful, but I'm running into some problems when it comes to performing searches across many relationships. As far as I understand it, the 'depth' parameter relates to how many nodes the traverser or path finder passes before halting and returning the stops, relationships or both. How would I go about querying a graph which contains the following data... Start [A] -> RELATES_TO -> [B] -> RELATES_TO -> [C] -> RELATES_TO -> [D] End ... without specifying a depth? At the moment I am having to pass the exact depth value (A -> B = 1, A->C = 2, etc) to actually get to my destination. Any ideas on how this could be accomplished? Thanks, - Peter -- View this message in context: http://neo4j-community-discussions.438527.n3.nabble.com/Depth-and-traversals-in-journey-planner-migration-tp3261892p3261892.html Sent from the Neo4j Community Discussions mailing list archive at Nabble.com. _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
