explain.depesz.com

A tool for finding a real cause for slow queries.

Result: o2t

options
# exclusive inclusive rows x rows loops node
1. 0.011 2.993 ↑ 1.0 10 1
→

Limit (cost=449.36..449.51 rows=10 width=70) (actual time=2.966..2.993 rows=10 loops=1)

  • Output: cod_abi, tipo, grup_banc, ragione_sociale
  • Buffers: shared hit=389
2. 0.018 2.982 ↑ 6.2 10 1
→

Group (cost=449.36..450.26 rows=62 width=70) (actual time=2.963..2.982 rows=10 loops=1)

  • Output: cod_abi, tipo, grup_banc, ragione_sociale
  • Buffers: shared hit=389
3. 1.249 2.964 ↑ 6.5 11 1
→

Sort (cost=449.36..449.54 rows=72 width=70) (actual time=2.959..2.964 rows=11 loops=1)

  • Output: cod_abi, tipo, grup_banc, ragione_sociale
  • Sort Key: "Bank".tipo, "Bank".ragione_sociale, "Bank".cod_abi, "Bank".grup_banc
  • Sort Method: quicksort Memory: 31kB
  • Buffers: shared hit=389
4. 1.715 1.715 ↓ 1.8 130 1
→

Seq Scan on public.tbl_ajax_ricerca "Bank" (cost=0.00..447.14 rows=72 width=70) (actual time=0.035..1.715 rows=130 loops=1)

  • Output: cod_abi, tipo, grup_banc, ragione_sociale
  • Filter: ((("Bank".regione)::text = 'EMILIA - ROMAGNA'::text) AND ("Bank".tipo = ANY ('{1,2,3}'::text[])) AND ("Bank".data_type = ANY ('{1,2,3,4}'::integer[])))
  • Buffers: shared hit=389