Structs§
Functions§
- In the ddl backpressure graph, we want to compute the backpressure between relations. So we need to know which are the fragments which are connected to external relations. These fragments form the vertices of the graph. We can get collection of backpressure values, keyed by vertex_id-vertex_id. This function will return a map of fragment vertex id to relation id. We can convert
fragment_id-fragment_id
torelation_id-relation_id
using that. Finally, we have a map ofrelation_id-relation_id
to backpressure values. - Provides a hierarchy of relation ids to fragments to actors.
- NOTE(kwannoel): Although we fetch the BP for the entire graph via this API, the workload should be reasonable. In most cases, we can safely assume each node has most 2 outgoing edges (e.g. join). In such a scenario, the number of edges is linear to the number of nodes. So the workload is proportional to the relation id graph we fetch in
get_relation_id_infos
.