[Pgsql-ayuda] Indices Lento

[Edwin Quijada]

*-------------------------------------------------------*
*-Edwin Quijada
*-Developer DataBase
*-JQ Microsistemas
*-809-747-2787
* " Si deseas lograr cosas excepcionales debes de hacer cosas fuera de lo 
comun"
*-------------------------------------------------------*


Aca esta el explain analyze que produjo Postgres

Merge Join  (cost=79.44..7127.72 rows=226 width=347) (actual 
time=7919.20..7967.18 rows=1 loops=1)
  Merge Cond: ("outer".f_wholenum = "inner".f_wholenum)
  ->  Nested Loop  (cost=0.00..7025.77 rows=1807 width=116) (actual 
time=82.17..130.12 rows=1 loops=1)
        ->  Nested Loop  (cost=0.00..17.13 rows=1 width=44) (actual 
time=80.56..127.55 rows=1 loops=1)
              Join Filter: ("outer".f_agente = "inner".f_codigo_agente)
              ->  Index Scan using t_poliza_vehiculos_f_wholenum_idx on 
t_poliza_vehiculos a  (cost=0.00..17.07 rows=5 width=40) (actual 
time=1.07..1.13 rows=1 loops=1)
                    Index Cond: (f_wholenum = 'POL000001'::bpchar)
              ->  Seq Scan on t_agentes c  (cost=0.00..0.00 rows=1 width=4) 
(actual time=63.71..120.25 rows=1765 loops=1)
        ->  Index Scan using f_id on t_clientes b  (cost=0.00..6986.05 
rows=1807 width=72) (actual time=1.51..2.45 rows=1 loops=1)
              Index Cond: ("outer".f_codigo_cliente = b.f_codigo_cliente)
  ->  Sort  (cost=79.44..79.76 rows=125 width=231) (actual 
time=7836.88..7836.88 rows=2 loops=1)
        Sort Key: d.f_wholenum
        ->  Hash Join  (cost=43.53..75.09 rows=125 width=231) (actual 
time=7829.15..7836.16 rows=3 loops=1)
              Hash Cond: ("outer".f_codigo_marca = "inner".f_idmarca)
              ->  Seq Scan on t_marcas_vehiculos g  (cost=0.00..20.00 
rows=1000 width=43) (actual time=1.16..6.30 rows=323 loops=1)
              ->  Hash  (cost=43.47..43.47 rows=25 width=188) (actual 
time=7827.77..7827.77 rows=0 loops=1)
                    ->  Hash Join  (cost=18.15..43.47 rows=25 width=188) 
(actual time=2524.75..7827.71 rows=3 loops=1)
                          Hash Cond: ("outer".f_idvehiculo = 
"inner".f_keyvehiculo)
                          ->  Seq Scan on t_vehiculos_asegurados d  
(cost=0.00..20.00 rows=1000 width=28) (actual time=2355.34..6842.67 
rows=241074 loops=1)
                          ->  Hash  (cost=18.14..18.14 rows=5 width=160) 
(actual time=2.23..2.23 rows=0 loops=1)
                                ->  Nested Loop  (cost=0.00..18.14 rows=5 
width=160) (actual time=1.66..2.17 rows=3 loops=1)
                                      ->  Seq Scan on t_vehiculos e  
(cost=0.00..1.01 rows=1 width=113) (actual time=0.39..0.48 rows=3 loops=1)
                                      ->  Index Scan using 
t_modelos_f_idmodelo_idx on t_modelos f  (cost=0.00..17.07 rows=5 width=47) 
(actual time=0.46..0.49 rows=1 loops=3)
                                            Index Cond: ("outer".f_modelo = 
f.f_idmodelo)
Total runtime: 7969.10 msec

_________________________________________________________________
Consigue aquí las mejores y mas recientes ofertas de trabajo en América 
Latina y USA: www.yupimsn.com/empleos