I need to get the total count of businesses in a particular state. My schema is designed such that business vertex is connected to suburb vertex via an edge. And then suburb to region and then region to state. Now each state will have multiple regions and each region will have multiple suburbs. Given the state name, I need to get all the businesses in it via regions and suburbs. Is there a way to fetch it in one query?
How do we do a traversal on one-to-many and many-to-many edges, and get the count?
Hi @aparajitha.neelakanta_192572,
do you only want to count the businesses?
Depending on the direction of your edges (you might have to use the in() step), to count the number of unique businesses you could do:
g.V().hasLabel("state").has("state_name", "x").out("connected_to_region").out("connected_to_suburb").out("connected_to_business").dedup().count()
Let me know if I understood your question correctly. Also, what version of Graph are you using?
Cheers!
Hi,
Your understanding is perfect and this query returns the data. However, due to the amount of data, it takes a long time and gives db timeout sometimes. Is there a more efficient way of writing this query?
yes, that was also my concern. It is not really an OLTP query. If you have Spark available, then you can run this query in OLAP mode or with graphframes, count queries of this type are better done with Spark. The default timeout for OLAP is also much more generous than for OLTP (168 hours vs 30 seconds). It might still not be very fast, but you won't run into any timeouts.
Have a look at this and see if this gets you started:
8 People are following this question.
