# | exclusive | inclusive | rows x | rows | loops | node |
---|---|---|---|---|---|---|
1. | 0.158 | 55.012 | ↑ 11.4 | 71 | 1 |
→
Sort (cost=146.63..148.65 rows=808 width=138) (actual time=55.009..55.012 rows=71 loops=1)
|
2. | 1.378 | 54.854 | ↑ 11.4 | 71 | 1 |
→
Hash Join (cost=1.14..107.61 rows=808 width=138) (actual time=42.495..54.854 rows=71 loops=1)
|
3. | 53.465 | 53.465 | ↓ 3.0 | 2,402 | 1 |
→
Seq Scan on pg_proc p (cost=0.00..89.30 rows=808 width=78) (actual time=0.052..53.465 rows=2,402 loops=1)
|
4. | 0.004 | 0.011 | ↑ 1.0 | 4 | 1 |
→
Hash (cost=1.09..1.09 rows=4 width=68) (actual time=0.011..0.011 rows=4 loops=1)
|
5. | 0.007 | 0.007 | ↑ 1.0 | 4 | 1 |
→
Seq Scan on pg_namespace n (cost=0.00..1.09 rows=4 width=68) (actual time=0.005..0.007 rows=4 loops=1)
|