Re: [PERFORM] A Better External Sort?
От | Zeugswetter Andreas DAZ SD |
---|---|
Тема | Re: [PERFORM] A Better External Sort? |
Дата | |
Msg-id | E1539E0ED7043848906A8FF995BDA5797F0067@m0143.s-mxs.net обсуждение исходный текст |
Ответ на | [PERFORM] A Better External Sort? (Ron Peacetree <rjpeace@earthlink.net>) |
Ответы |
Re: [PERFORM] A Better External Sort?
Re: [PERFORM] A Better External Sort? |
Список | pgsql-hackers |
> Now I've asked for the quickest path to detailed > understanding of the pg IO subsystem. The goal being to get > more up to speed on its coding details. Certainly not to > annoy you or anyone else. Basically pg does random 8k (compile time blocksize) reads/writes only. Bitmap and sequential scans read 8k blocks in order. Only WAL does n x 8k writes with one system call. pg relys on the OS readahead (== larger block IO) to do efficient IO. Basically the pg scan performance should match a dd if=file of=/dev/null bs=8k, unless CPU bound. Andreas
В списке pgsql-hackers по дате отправления: