You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
If you squint you will see that this query actually executes fetches 6 times. Which leads to abysmal performance and runs us very quickly into QoS limits.
The ideal query would look like:
f = fetch name:failures node:* ... | sum node;
t = fetch name:{failures,successes} node:* ... | sum node;
(f) | asPercent (t)
The reason "rollup" is in quotes, is this is effectively this data:
node:A => 9
node:B => 11
node:C => 12
We know this is not possible today with R2, but we are asking the experts if this could ever be possible, and some hint as towards how we could submit a pull request for such a change.
Currently the workaround we are using today is triple emission:
We have some very high cardinality data that we are representing as an undirected graph.
In order to reduce the m3 burden, we emit edges of the graph, using "lo" and "hi" tags, so that we drastically reduce the cardinality in the system.
For example, with the following graph:
We would emit:
Note, and this is the problem, that B appears as both low and high in the graph.
As well as the edges, we want to calculate per node "rollups". The way we are currently doing this is:
If you squint you will see that this query actually executes fetches 6 times. Which leads to abysmal performance and runs us very quickly into QoS limits.
The ideal query would look like:
The reason "rollup" is in quotes, is this is effectively this data:
We know this is not possible today with R2, but we are asking the experts if this could ever be possible, and some hint as towards how we could submit a pull request for such a change.
Currently the workaround we are using today is triple emission:
... Which is not ideal.
Full credit to @NonLogicalDev for the write up.
The text was updated successfully, but these errors were encountered: