Re: [GENERAL] Huge iowait during checkpoint finish

2010-01-11 Thread Anton Belyaev
2010/1/9 Scott Marlowe : > On Fri, Jan 8, 2010 at 3:07 PM, Greg Smith wrote: >> Basically, you have a couple of standard issues here: >> >> 1) You're using RAID-5, which is not known for good write performance.  Are >> you sure the disk array performs well on writes?  And if you didn't >> benchmar

Re: [GENERAL] Huge iowait during checkpoint finish

2010-01-11 Thread Anton Belyaev
Hello Greg, Thanks for you extensive reply. 2010/1/9 Greg Smith : > Anton Belyaev wrote: >> >> I think all the IOwait comes during sync time, which is 80 s, >> according to the log entry. >> > > I believe you are correctly diagnosing the issue.  The "sync ti

[GENERAL] Huge iowait during checkpoint finish

2010-01-08 Thread Anton Belyaev
Hello dear list members, I have strange problem with my new 8.4 deployment, which I never encountered on previous 8.3 deployment. IOwait values are extremely high exactly when Postgres finishes a checkpoint. During the checkpoint itself (which is quite lengthy) IOwait is very low. Why does this ha

Re: [GENERAL] R-tree, order by, limit

2008-09-22 Thread Anton Belyaev
2008/9/22 Mark Cave-Ayland <[EMAIL PROTECTED]>: >>> I am implementing a map application. There are towns with altitude, >>> longitude and population. >>> One of the tasks is to be able to query N biggest (by population) >>> towns within a rectangle. > Have you considered using PostGIS? (http://post

Re: [GENERAL] R-tree, order by, limit

2008-09-22 Thread Anton Belyaev
2008/9/21 Martijn van Oosterhout <[EMAIL PROTECTED]>: > On Sun, Sep 21, 2008 at 06:17:39PM +0400, Anton Belyaev wrote: >> Geometry types and functions use R-tree indexes anyways. >> >> I can rephrase the query using geometry language of Postgres: >> SELECT * F

Re: [GENERAL] R-tree, order by, limit

2008-09-21 Thread Anton Belyaev
2008/9/21 Anton Belyaev <[EMAIL PROTECTED]>: > Hello, > > I am implementing a map application. There are towns with altitude, > longitude and population. > One of the tasks is to be able to query N biggest (by population) > towns within a rectangle. > > Something

Re: [GENERAL] R-tree, order by, limit

2008-09-21 Thread Anton Belyaev
2008/9/21 Volkan YAZICI <[EMAIL PROTECTED]>: > On Sun, 21 Sep 2008, "Anton Belyaev" <[EMAIL PROTECTED]> writes: >> SELECT * FROM towns where alt1 <= alt <= alt2 AND long1 <= long <= >> long2 ORDER BY population LIMIT 10; > > You're

[GENERAL] R-tree, order by, limit

2008-09-21 Thread Anton Belyaev
Hello, I am implementing a map application. There are towns with altitude, longitude and population. One of the tasks is to be able to query N biggest (by population) towns within a rectangle. Something like (maybe the syntax in not quite right, but the idea is obvious): SELECT * FROM towns where