MuhammadTahaNaveed commented on PR #2468: URL: https://github.com/apache/age/pull/2468#issuecomment-4978903278
@eeshwarg This does not seem like the best approach going forward, especially for larger graphs with many edge labels. With labels A, B, C, D, E, `MATCH ()-[r:A|B]->()` should only scan A and B. This PR appears to scan `_ag_label_edge`, which expands to A+B+C+D+E, and then filters by `_extract_label_id(r.id) IN (...)`. That makes unrelated labels C/D/E part of the access path. The implementation should ideally build an Append/Union over only the resolved A and B relations. -- 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]
