# | exclusive | inclusive | rows x | rows | loops | node |
---|---|---|---|---|---|---|
1. | 173.254 | 2,258.031 | ↓ 6.9 | 15,275 | 1 |
→
Nested Loop Left Join (cost=8.82..381,207.76 rows=2,216 width=777) (actual time=0.617..2,258.031 rows=15,275 loops=1)
|
2. | 37.649 | 878.052 | ↓ 6.9 | 15,275 | 1 |
→
Nested Loop Left Join (cost=8.26..46,461.11 rows=2,216 width=748) (actual time=0.293..878.052 rows=15,275 loops=1)
|
3. | 35.596 | 764.028 | ↓ 6.9 | 15,275 | 1 |
→
Nested Loop Left Join (cost=7.70..31,979.53 rows=2,216 width=735) (actual time=0.283..764.028 rows=15,275 loops=1)
|
4. | 38.743 | 621.507 | ↓ 6.9 | 15,275 | 1 |
→
Nested Loop Left Join (cost=7.14..17,497.94 rows=2,216 width=706) (actual time=0.271..621.507 rows=15,275 loops=1)
|
5. | 27.662 | 414.739 | ↓ 6.9 | 15,275 | 1 |
→
Hash Join (cost=6.59..3,016.36 rows=2,216 width=677) (actual time=0.245..414.739 rows=15,275 loops=1)
|
6. | 59.176 | 387.010 | ↓ 6.9 | 15,275 | 1 |
→
Nested Loop (cost=4.80..2,984.10 rows=2,216 width=679) (actual time=0.167..387.010 rows=15,275 loops=1)
|
7. | 30.146 | 234.184 | ↓ 8.7 | 18,730 | 1 |
→
Hash Left Join (cost=4.51..2,095.39 rows=2,146 width=598) (actual time=0.155..234.184 rows=18,730 loops=1)
|
8. | 45.324 | 203.950 | ↓ 8.7 | 18,730 | 1 |
→
Nested Loop Left Join (cost=1.94..2,082.05 rows=2,146 width=582) (actual time=0.059..203.950 rows=18,730 loops=1)
|
9. | 37.083 | 64.976 | ↓ 8.7 | 18,730 | 1 |
→
Hash Join (cost=1.52..796.27 rows=2,146 width=566) (actual time=0.039..64.976 rows=18,730 loops=1)
|
10. | 27.870 | 27.870 | ↑ 1.0 | 24,729 | 1 |
→
Seq Scan on public.t_document d (cost=0.00..679.42 rows=25,031 width=52) (actual time=0.007..27.870 rows=24,729 loops=1)
|
11. | 0.006 | 0.023 | ↑ 1.0 | 3 | 1 |
→
Hash (cost=1.48..1.48 rows=3 width=518) (actual time=0.023..0.023 rows=3 loops=1)
|
12. | 0.017 | 0.017 | ↑ 1.0 | 3 | 1 |
→
Seq Scan on public.t_business_object_types dbot (cost=0.00..1.48 rows=3 width=518) (actual time=0.006..0.017 rows=3 loops=1)
|
13. | 93.650 | 93.650 | ↓ 0.0 | 0 | 18,730 |
→
Index Only Scan using l_readers_pkey on public.l_readers read (cost=0.42..0.59 rows=1 width=16) (actual time=0.005..0.005 rows=0 loops=18,730)
|
14. | 0.041 | 0.088 | ↓ 1.0 | 45 | 1 |
→
Hash (cost=2.03..2.03 rows=44 width=16) (actual time=0.088..0.088 rows=45 loops=1)
|
15. | 0.047 | 0.047 | ↓ 1.0 | 45 | 1 |
→
Seq Scan on public.l_favorites fav (cost=0.00..2.03 rows=44 width=16) (actual time=0.008..0.047 rows=45 loops=1)
|
16. | 93.650 | 93.650 | ↑ 1.0 | 1 | 18,730 |
→
Index Scan using t_card_parent_id_idx on public.t_card c (cost=0.29..0.40 rows=1 width=97) (actual time=0.005..0.005 rows=1 loops=18,730)
|
17. | 0.032 | 0.067 | ↑ 1.0 | 35 | 1 |
→
Hash (cost=1.35..1.35 rows=35 width=2) (actual time=0.067..0.067 rows=35 loops=1)
|
18. | 0.035 | 0.035 | ↑ 1.0 | 35 | 1 |
→
Seq Scan on public.t_business_object_types cbot (cost=0.00..1.35 rows=35 width=2) (actual time=0.009..0.035 rows=35 loops=1)
|
19. | 168.025 | 168.025 | ↑ 1.0 | 1 | 15,275 |
→
Index Scan using t_properties_business_object_id_property_idx on public.t_properties pc (cost=0.56..6.53 rows=1 width=45) (actual time=0.010..0.011 rows=1 loops=15,275)
|
20. | 106.925 | 106.925 | ↓ 0.0 | 0 | 15,275 |
→
Index Scan using t_properties_business_object_id_property_idx on public.t_properties pis (cost=0.56..6.53 rows=1 width=45) (actual time=0.006..0.007 rows=0 loops=15,275)
|
21. | 76.375 | 76.375 | ↓ 0.0 | 0 | 15,275 |
→
Index Scan using t_properties_business_object_id_property_idx on public.t_properties psn (cost=0.56..6.53 rows=1 width=45) (actual time=0.005..0.005 rows=0 loops=15,275)
|
22. | 137.475 | 137.475 | ↑ 1.0 | 1 | 15,275 |
→
Index Scan using t_properties_business_object_id_property_idx on public.t_properties pt (cost=0.56..6.59 rows=1 width=45) (actual time=0.008..0.009 rows=1 loops=15,275)
|
23. |
SubPlan (forNested Loop Left Join) |
|||||
24. | 122.200 | 122.200 | ↑ 7.0 | 1 | 15,275 |
→
Index Scan using t_docflow_businessobjects_parent_id_idx on public.t_docflow_businessobjects (cost=0.42..52.75 rows=7 width=0) (actual time=0.008..0.008 rows=1 loops=15,275)
|
25. | 0.000 | 0.000 | ↓ 0.0 | 0 |
→
Seq Scan on public.t_docflow_businessobjects t_docflow_businessobjects_1 (cost=0.00..79,018.98 rows=369,780 width=16) (never executed)
|
|
26. | 45.825 | 549.900 | ↓ 0.0 | 0 | 15,275 |
→
Limit (cost=68.28..68.28 rows=1 width=9) (actual time=0.036..0.036 rows=0 loops=15,275)
|
27. | 61.100 | 504.075 | ↓ 0.0 | 0 | 15,275 |
→
Sort (cost=68.28..68.28 rows=2 width=9) (actual time=0.033..0.033 rows=0 loops=15,275)
|
28. | 45.825 | 442.975 | ↓ 0.0 | 0 | 15,275 |
→
Subquery Scan on control_date_sub_query (cost=68.22..68.27 rows=2 width=9) (actual time=0.028..0.029 rows=0 loops=15,275)
|
29. | 30.550 | 397.150 | ↓ 0.0 | 0 | 15,275 |
→
HashAggregate (cost=68.22..68.25 rows=2 width=28) (actual time=0.026..0.026 rows=0 loops=15,275)
|
30. | 141.715 | 366.600 | ↓ 0.0 | 0 | 15,275 |
→
Nested Loop (cost=4.59..68.21 rows=2 width=28) (actual time=0.021..0.024 rows=0 loops=15,275)
|
31. | 61.100 | 137.475 | ↑ 2.0 | 1 | 15,275 |
→
Bitmap Heap Scan on public.t_resolution r (cost=4.30..11.94 rows=2 width=32) (actual time=0.008..0.009 rows=1 loops=15,275)
|
32. | 76.375 | 76.375 | ↑ 2.0 | 1 | 15,275 |
→
Bitmap Index Scan on t_resolution_parent_id_idx (cost=0.00..4.30 rows=2 width=0) (actual time=0.005..0.005 rows=1 loops=15,275)
|
33. | 87.394 | 87.410 | ↓ 0.0 | 0 | 17,482 |
→
Index Scan using t_resolution_task_parent_id_idx on public.t_resolution_task rt (cost=0.29..28.12 rows=1 width=60) (actual time=0.005..0.005 rows=0 loops=17,482)
|
34. |
SubPlan (forIndex Scan) |
|||||
35. | 0.008 | 0.016 | ↓ 0.0 | 0 | 1 |
→
Bitmap Heap Scan on public.t_resolution_task_executer rte (cost=4.45..19.81 rows=1 width=0) (actual time=0.016..0.016 rows=0 loops=1)
|
36. | 0.008 | 0.008 | ↑ 2.0 | 2 | 1 |
→
Bitmap Index Scan on t_resolution_task_executer_parent_id_idx (cost=0.00..4.45 rows=4 width=0) (actual time=0.008..0.008 rows=2 loops=1)
|
37. | 0.000 | 0.000 | ↓ 0.0 | 0 |
→
Seq Scan on public.t_resolution_task_executer rte_1 (cost=0.00..2,159.32 rows=15,513 width=16) (never executed)
|
|
38. | 106.925 | 397.150 | ↑ 1.0 | 1 | 15,275 |
→
Aggregate (cost=68.23..68.24 rows=1 width=28) (actual time=0.025..0.026 rows=1 loops=15,275)
|
39. | 113.372 | 290.225 | ↓ 0.0 | 0 | 15,275 |
→
Nested Loop (cost=4.59..68.20 rows=2 width=28) (actual time=0.017..0.019 rows=0 loops=15,275)
|
40. | 45.825 | 106.925 | ↑ 2.0 | 1 | 15,275 |
→
Bitmap Heap Scan on public.t_resolution r_1 (cost=4.30..11.94 rows=2 width=32) (actual time=0.006..0.007 rows=1 loops=15,275)
|
41. | 61.100 | 61.100 | ↑ 2.0 | 1 | 15,275 |
→
Bitmap Index Scan on t_resolution_parent_id_idx (cost=0.00..4.30 rows=2 width=0) (actual time=0.004..0.004 rows=1 loops=15,275)
|
42. | 69.917 | 69.928 | ↓ 0.0 | 0 | 17,482 |
→
Index Scan using t_resolution_task_parent_id_idx on public.t_resolution_task rt_1 (cost=0.29..28.12 rows=1 width=60) (actual time=0.003..0.004 rows=0 loops=17,482)
|
43. |
SubPlan (forIndex Scan) |
|||||
44. | 0.006 | 0.011 | ↓ 0.0 | 0 | 1 |
→
Bitmap Heap Scan on public.t_resolution_task_executer rte_2 (cost=4.45..19.81 rows=1 width=0) (actual time=0.011..0.011 rows=0 loops=1)
|
45. | 0.005 | 0.005 | ↑ 2.0 | 2 | 1 |
→
Bitmap Index Scan on t_resolution_task_executer_parent_id_idx (cost=0.00..4.45 rows=4 width=0) (actual time=0.005..0.005 rows=2 loops=1)
|
46. | 0.000 | 0.000 | ↓ 0.0 | 0 |
→
Seq Scan on public.t_resolution_task_executer rte_3 (cost=0.00..2,159.32 rows=15,513 width=16) (never executed)
|