Hi,
On 12 August 2011 14:57, Greg Smith wrote:
> ioDrive hardware is fast at executing all sorts of I/O, but it particularly
> excels compared to normal drives with really random workloads.
That's what I hope for :). It looks like that ioDrive is 3 to 5 times
faster for seq IO comparing to our S
W. Matthew Wilson wrote:
I'm sure I'm not the first person to end up with a gigantic query that
does lots of left joins and subselects.
It seems to work, but I would love to break it up into smaller chunks.
I'm thinking about rewriting the query to make several temporary
tables that are dropp
Hi,
On 14 August 2011 20:25, k_b wrote:
> Hi.
> For learning purpose i would like to make a small database with a small
> graph of locations, roads and public transport information.
> Then calculate the fastest or cheapest way between two points.
>
> If we think of a minimal network, as below.
>
Hi.
I've experienced very similar behavior and log message. I do not know what
is the problem in detail but my guess is that standby system has data which
is incompatible to accept streaming replication of the master.
The way I solved is the following on Ubuntu11.04. Suppose postgresql.conf
and r
Thanks for everyone.
I will give reply after some experiments.
Regards,
Chaitanya Kulkarni
On Sun, Aug 14, 2011 at 6:04 PM, wrote:
> On Aug 14 2011, Uwe Schroeder wrote:
>
>
>>
>> > can u please give me it's link.
>>> > I found ngx_postgres module.
>>> > >> there is nginx_htttp_postgresql_
On Sun, 2011-08-14 at 12:23 -0400, Colin Beckingham wrote:
> On 08/14/2011 12:16 PM, Guillaume Lelarge wrote:
> > On Sun, 2011-08-14 at 10:45 -0400, Colin Beckingham wrote:
> >> Using OpenSUSE 11.4, kernel 3.0.
> >> wxWidgets version 2.8.11.
> >> While compiling pgadmin1-1.14.0-beta3, configure com
On 08/14/2011 12:16 PM, Guillaume Lelarge wrote:
On Sun, 2011-08-14 at 10:45 -0400, Colin Beckingham wrote:
Using OpenSUSE 11.4, kernel 3.0.
wxWidgets version 2.8.11.
While compiling pgadmin1-1.14.0-beta3, configure completes correctly but
make fails on:
./ctl/ctlMenuToolbar.cpp: In member func
On Sun, 2011-08-14 at 10:45 -0400, Colin Beckingham wrote:
> Using OpenSUSE 11.4, kernel 3.0.
> wxWidgets version 2.8.11.
> While compiling pgadmin1-1.14.0-beta3, configure completes correctly but
> make fails on:
>
> ./ctl/ctlMenuToolbar.cpp: In member function ‘void
> ctlMenuToolbar::DoProcess
On Sun, Aug 14, 2011 at 12:44 AM, MirrorX wrote:
> the issue here is that the server is heavily loaded. the daily traffic is
> heavy, which means the db size is increasing every day (by 30 gb on
> average)
> and the size is already pretty large (~2TB).
>
> at the moment, the copy of the PGDATA fo
On Sun, Aug 14, 2011 at 10:39:48AM -0400, W. Matthew Wilson wrote:
> I'm sure I'm not the first person to end up with a gigantic query that
> does lots of left joins and subselects.
>
> It seems to work, but I would love to break it up into smaller chunks.
>
> I'm thinking about rewriting the que
Using OpenSUSE 11.4, kernel 3.0.
wxWidgets version 2.8.11.
While compiling pgadmin1-1.14.0-beta3, configure completes correctly but
make fails on:
./ctl/ctlMenuToolbar.cpp: In member function ‘void
ctlMenuToolbar::DoProcessLeftClick(wxMouseEvent&)’:
./ctl/ctlMenuToolbar.cpp:161:2: error: ‘Node
I'm sure I'm not the first person to end up with a gigantic query that
does lots of left joins and subselects.
It seems to work, but I would love to break it up into smaller chunks.
I'm thinking about rewriting the query to make several temporary
tables that are dropped on commit, and then joinin
On 14/08/11 05:12, David Johnston wrote:
On Aug 13, 2011, at 11:57, c k wrote:
Dear Postgres users,
from last few months I am reading and searching for can postgresql used as
application server? As postgresql supports many languages like pl/perl,
pl/python etc, supports dblink like function
thx a lot. i will definitely look into that option
in the meantime, if there are any other suggestions i 'd love to hear them
--
View this message in context:
http://postgresql.1045698.n5.nabble.com/backup-strategies-for-large-databases-tp4697145p4698006.html
Sent from the PostgreSQL - general m
Hi.
For learning purpose i would like to make a small database with a small graph
of locations, roads and public transport information.
Then calculate the fastest or cheapest way between two points.
If we think of a minimal network, as below.
A ---5-- B ---10 C
\ /
\-
Hi,
I've recently looked into the problem of my INSERTs throwing an ROW
error, when a new row hits an already present one, by unique constraint.
It triggers an expensive rollback, and I'd like to have it sort of
"optimised". In my case, duplicates can be discarded on an attempt
INSERT, but an UPDA
16 matches
Mail list logo
