Re: Sorting performance vs. MySQL
От | Frank Heikens |
---|---|
Тема | Re: Sorting performance vs. MySQL |
Дата | |
Msg-id | 475A81B1-52E6-4DAE-B72B-142B0E3464F7@mac.com обсуждение исходный текст |
Ответ на | Re: Sorting performance vs. MySQL (Yang Zhang <yanghatespam@gmail.com>) |
Ответы |
Re: Sorting performance vs. MySQL
|
Список | pgsql-general |
Op 22 feb 2010, om 20:28 heeft Yang Zhang het volgende geschreven: > > >> >> >>>> If your work-mem is too low there's a good chance that Postgres >>>> has to >>>> use your disks for sorting, which will obviously be quite slow. >>> >>> Relative to the non-terminating 80-minute-so-far sort, Unix sort >>> runs >>> much faster (on the order of several minutes). >> >> Make sure your index does fit into memory, what's the size of the >> index? > > How might I find out the size and whether it's being fit in memory? SELECT pg_size_pretty(pg_relation_size('i_transactionid')); > -- > Yang Zhang > http://www.mit.edu/~y_z/ > > -- > Sent via pgsql-general mailing list (pgsql-general@postgresql.org) > To make changes to your subscription: > http://www.postgresql.org/mailpref/pgsql-general Frank Heikens
В списке pgsql-general по дате отправления: