jrgemignani edited a comment on issue #195: URL: https://github.com/apache/incubator-age/issues/195#issuecomment-1063158436
The time taken depends on a couple of factors: The size of the graph, how connected the graph is, how qualified the query is, and some PostgreSQL quirks. Without seeing some statistics (like the number of results returned) on the results from the previous queries I can only guess. I would guess that each progressive query likely returns more results. PostgreSQL has an annoying habit of not returning anything until everything has been processed. So, while it is getting results (tuples), it won't display anything until it has received them all. If the resultant set is large, this will take a while. If you can constrain the query, that may help. If you aren't using a variable, don't include it because it can slow the process down. You can use RETURN count(z) in place of RETURN z.id to see how large the set is and that usually runs faster as it is just counting. Remember, *..x means all lengths from 1 to x will be included in the results. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
