jrgemignani commented on issue #1413:
URL: https://github.com/apache/age/issues/1413#issuecomment-1836730008

   @ajit-satav For a VLE MATCH, indexes will have minimal impact on 
performance. 
   
   The reason your query is running long is due to specifying a directionless 
and unlimited length edge `-[*]-` If you want to improve performance, you will 
need to put restrictions on it. Even on small graphs, specifying directionless 
edges along with unlimited length edges can take a long time. This is partly 
due to PostgreSQL and partly due to graph traversal in general.
   
   Edges in AGE have a direction. By querying with directionless edges, you can 
dramatically increase the number of paths through vertices and the path finding 
algorithms needs to find them all.
   
   PostgreSQL, via the command line, will want to finish processing the entire 
query before outputting paged results. You can use the LIMIT command to force 
it to stop after a specified number of found values. However, I don't know if 
there is a way to force it to show results as it finds them.


-- 
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: dev-unsubscr...@age.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org

Reply via email to