xephtar commented on issue #690:
URL: https://github.com/apache/age/issues/690#issuecomment-2915895274
Hi,
Years after initially optimizing this query in Neo4j, we're now considering
moving back to Apache AGE. Our graph structure is as follows:
A Label - HAS_Y -> Y Label
A Label - HAS_Z -> Z Label
The traversal logic we use is:
MATCH (n:Y {property_example: 123})-[r*..4]-(d:A)
RETURN d.property_found AS property_found
LIMIT 50
UNION ALL
MATCH (n:Z {property_example: 123})-[r*..4]-(d:A)
RETURN d.property_found AS property_found
LIMIT 50
We expect around 500 million nodes and 3–4x that number in relationships.
Question:
What kind of indexing strategy would you recommend for optimizing traversal
performance in Apache AGE for this type of pattern?
Any guidance or best practices regarding node properties or relationship
indexing (if supported) would be highly appreciated.
Thanks in advance!
--
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
