Assigned
Status Update
No update yet.
Comments
va...@google.com
sa...@google.com
Hello,
Thank you for reaching out to us with your request.
We have duly noted your feedback and will thoroughly validate it. While we cannot provide an estimated time of implementation or guarantee the fulfillment of the issue, please be assured that your input is highly valued. Your feedback enables us to enhance our products and services.
We appreciate your continued trust and support in improving our Google Cloud Platform products. In case you want to report a new issue, Please do not hesitate to create a new issue on the
Once again, we sincerely appreciate your valuable feedback; Thank you for your understanding and collaboration.
Description
An operator COMPONENT(element) which returns a list of elements that are all part of the same component. An operator that acts on the whole graph that would return all distinct components would also be useful in a lot of cases.
How this might work:
Perhaps it's possible to write a Spanner Query such that it finds any element's component, but I've been unable to write one. If it is possible, the operator would just behave like a macro. Otherwise, a recursive algorithm would have to be implemented.
If applicable, reasons why alternative solutions are not sufficient:
I believe there are no clear solutions at this point.
Other information (workarounds you have tried, documentation consulted, etc):
There's no documentation or examples which explains how to find components, perhaps because it's not possible or computationally unfeasible with the current query language.