Re: [PERFORM] index & Bitmap Heap Scan

Thank you for your answer. Now i ve to find how to reduce the size of the table. Paul. Le mardi 28 août 2007 à 12:55 -0400, Tom Lane a écrit : > Paul <[EMAIL PROTECTED]> writes: > > Why in the first case, pgsql uses the "better" index and if i search > > r_service instead of r_numero pgsql does a

Re: [PERFORM] index & Bitmap Heap Scan

Paul <[EMAIL PROTECTED]> writes: > Why in the first case, pgsql uses the "better" index and if i search > r_service instead of r_numero pgsql does a "Bitmap Heap scan" first ? Given the difference in the number of rows to be fetched, both plan choices look pretty reasonable to me. If you want to

[PERFORM] index & Bitmap Heap Scan

Hello, I have a table (stats.tickets) with 2288965 rows (51 columns) and indexes like: ind_ti_stats_numero btree (tday, tmonth, tyear, r_cat, r_numero) ind_ti_stats_service btree (tday, tmonth, tyear, r_cat, r_service) ind_ti_stats_tmp_service btree (r_service, tyear, tmonth) ind_ti_stats_tmp_se