explain.depesz.com

PostgreSQL's explain analyze made readable

Result: v1vL : Sampling

Settings
# exclusive inclusive rows x rows loops node
1. 0.021 36.103 ↓ 0.0 0 1

Result (cost=0.00..1,305.00 rows=1 width=9) (actual time=36.103..36.103 rows=0 loops=1)

  • (slice0) Executor memory: 4563K bytes. Work_mem: 49K bytes max.
  • (slice1) Executor memory: 100K bytes avg x 4 workers, 100K bytes max (seg0).
  • (slice2) Executor memory: 3660K bytes avg x 4 workers, 3660K bytes max (seg0).
  • (slice3) Executor memory: 60K bytes avg x 4 workers, 60K bytes max (seg0).
  • (slice4) Executor memory: 3660K bytes avg x 4 workers, 3660K bytes max (seg0).
  • (slice5) Executor memory: 60K bytes avg x 4 workers, 60K bytes max (seg0).Memory used: 126976kBOptimizer: Pivotal Optimizer (GPORCA) version 3.88.0
2. 0.002 36.082 ↓ 0.0 0 1

Result (cost=0.00..1,305.00 rows=1 width=16) (actual time=36.082..36.082 rows=0 loops=1)

3. 0.741 36.080 ↓ 0.0 0 1

Hash Left Join (cost=0.00..1,305.00 rows=1 width=16) (actual time=36.080..36.080 rows=0 loops=1)

  • Hash Cond: (container.barcode = container_operation_1.barcode)
  • Extra Text: Hash chain length 1.0 avg, 1 max, using 33 of 131072 buckets.
4. 0.196 0.646 ↓ 0.0 0 1

Hash Anti Join (cost=0.00..868.00 rows=1 width=8) (actual time=0.646..0.646 rows=0 loops=1)

  • Hash Cond: (container.barcode = container_operation.barcode)
  • Extra Text: Hash chain length 0.0 avg, 0 max, using 0 of 131072 buckets.
5. 0.013 0.013 ↓ 0.0 0 1

Gather Motion 4:1 (slice1; segments: 4) (cost=0.00..431.00 rows=1 width=8) (actual time=0.013..0.013 rows=0 loops=1)

6. 0.000 0.000 ↓ 0.0 0

Seq Scan on container (cost=0.00..431.00 rows=1 width=8) (never executed)

  • Filter: ((im_origin_impc_code = 'A'::text) AND (im_destination_impc_code = 'ABCD'::text) AND (im_category = 'ABCD'::text) AND ((im_format ~~* 'X'::text) OR (im_format ~~* 'P'::text) OR (im_format ~~* 'S'::text) OR (im_format ~~* 'G'::text) OR (im_format ~~* 'E'::text)))
7. 0.000 0.437 ↓ 0.0 0 1

Hash (cost=437.00..437.00 rows=1 width=8) (actual time=0.437..0.437 rows=0 loops=1)

  • Buckets: 131072 Batches: 1 Memory Usage: 0kB
8. 0.008 0.437 ↓ 0.0 0 1

Result (cost=0.00..437.00 rows=1 width=8) (actual time=0.437..0.437 rows=0 loops=1)

9. 0.401 0.429 ↓ 0.0 0 1

Hash Join (cost=0.00..437.00 rows=1 width=8) (actual time=0.429..0.429 rows=0 loops=1)

  • Hash Cond: ((container_operation.type_id)::integer = operation_type.id)
  • Extra Text: Hash chain length 0.0 avg, 0 max, using 0 of 131072 buckets.
10. 0.000 0.000 ↓ 0.0 0

Gather Motion 4:1 (slice2; segments: 4) (cost=0.00..431.00 rows=1 width=10) (never executed)

11. 0.037 30.371 ↓ 25.0 25 1

Sequence (cost=0.00..431.00 rows=1 width=10) (actual time=3.797..30.371 rows=25 loops=1)

12. 0.000 0.000 ↓ 0.0 0

Partition Selector for container_operation (dynamic scan id: 1) (cost=10.00..100.00 rows=25 width=4) (never executed)

  • Partitions selected: 85 (out of 85)
13. 30.334 30.334 ↓ 25.0 25 1

Dynamic Seq Scan on container_operation (dynamic scan id: 1) (cost=0.00..431.00 rows=1 width=10) (actual time=3.762..30.334 rows=25 loops=1)

  • Partitions scanned: Avg 85.0 (out of 85) x 4 workers. Max 85 parts (seg0).
14. 0.001 0.028 ↓ 0.0 0 1

Hash (cost=6.00..6.00 rows=1 width=4) (actual time=0.028..0.028 rows=0 loops=1)

  • Buckets: 131072 Batches: 1 Memory Usage: 0kB
15. 0.010 0.027 ↓ 0.0 0 1

Assert (cost=0.00..6.00 rows=1 width=4) (actual time=0.027..0.027 rows=0 loops=1)

  • Assert Cond: ((row_number() OVER (?)) = 1)
16. 0.005 0.017 ↓ 0.0 0 1

WindowAgg (cost=0.00..6.00 rows=1 width=12) (actual time=0.017..0.017 rows=0 loops=1)

17. 0.012 0.012 ↓ 0.0 0 1

Gather Motion 4:1 (slice3; segments: 4) (cost=0.00..6.00 rows=1 width=4) (actual time=0.012..0.012 rows=0 loops=1)

18. 0.000 0.000 ↓ 0.0 0

Index Scan using operation_type_code_key on operation_type (cost=0.00..6.00 rows=1 width=4) (never executed)

  • Index Cond: (code = 'OPENING'::text)
19. 0.026 34.693 ↓ 33.0 33 1

Hash (cost=437.00..437.00 rows=1 width=16) (actual time=34.693..34.693 rows=33 loops=1)

  • Buckets: 131072 Batches: 1 Memory Usage: 2kB
20. 0.012 34.667 ↓ 33.0 33 1

Result (cost=0.00..437.00 rows=1 width=16) (actual time=34.645..34.667 rows=33 loops=1)

21. 0.034 34.655 ↓ 33.0 33 1

GroupAggregate (cost=0.00..437.00 rows=1 width=16) (actual time=34.635..34.655 rows=33 loops=1)

  • Group Key: container_operation_1.barcode
22. 0.344 34.621 ↓ 34.0 34 1

Sort (cost=0.00..437.00 rows=1 width=8) (actual time=34.613..34.621 rows=34 loops=1)

  • Sort Key: container_operation_1.barcode
  • Sort Method: quicksort Memory: 49kB
23. 0.632 34.277 ↓ 34.0 34 1

Hash Join (cost=0.00..437.00 rows=1 width=8) (actual time=23.640..34.277 rows=34 loops=1)

  • Hash Cond: ((container_operation_1.type_id)::integer = operation_type_1.id)
  • Extra Text: Hash chain length 1.0 avg, 1 max, using 1 of 131072 buckets.
24. 0.000 32.658 ↓ 61.0 61 1

Gather Motion 4:1 (slice4; segments: 4) (cost=0.00..431.00 rows=1 width=10) (actual time=22.302..32.658 rows=61 loops=1)

25. 0.066 33.275 ↓ 25.0 25 1

Sequence (cost=0.00..431.00 rows=1 width=10) (actual time=4.129..33.275 rows=25 loops=1)

26. 0.000 0.000 ↓ 0.0 0

Partition Selector for container_operation (dynamic scan id: 2) (cost=10.00..100.00 rows=25 width=4) (never executed)

  • Partitions selected: 85 (out of 85)
27. 33.209 33.209 ↓ 25.0 25 1

Dynamic Seq Scan on container_operation container_operation_1 (dynamic scan id: 2) (cost=0.00..431.00 rows=1 width=10) (actual time=4.070..33.209 rows=25 loops=1)

  • Partitions scanned: Avg 85.0 (out of 85) x 4 workers. Max 85 parts (seg0).
28. 0.006 0.987 ↑ 1.0 1 1

Hash (cost=6.00..6.00 rows=1 width=4) (actual time=0.987..0.987 rows=1 loops=1)

  • Buckets: 131072 Batches: 1 Memory Usage: 1kB
29. 0.018 0.981 ↑ 1.0 1 1

Assert (cost=0.00..6.00 rows=1 width=4) (actual time=0.977..0.981 rows=1 loops=1)

  • Assert Cond: ((row_number() OVER (?)) = 1)
30. 0.036 0.963 ↑ 1.0 1 1

WindowAgg (cost=0.00..6.00 rows=1 width=12) (actual time=0.959..0.963 rows=1 loops=1)

31. 0.832 0.927 ↑ 1.0 1 1

Gather Motion 4:1 (slice5; segments: 4) (cost=0.00..6.00 rows=1 width=4) (actual time=0.926..0.927 rows=1 loops=1)

32. 0.095 0.095 ↑ 1.0 1 1

Index Scan using operation_type_code_key on operation_type operation_type_1 (cost=0.00..6.00 rows=1 width=4) (actual time=0.094..0.095 rows=1 loops=1)

  • Index Cond: (code = 'CONTAINER_FORMING'::text)
Planning time : 185.703 ms
Execution time : 86.600 ms