Skip site navigation (1) Skip section navigation (2)

Re: Big databases vs small databases

From: Christian Pöcher <Poecher(at)gmx(dot)net>
To: <pgsql-novice(at)postgresql(dot)org>
Subject: Re: Big databases vs small databases
Date: 2004-02-19 00:26:05
Message-ID: 002001c3f67e$f681f4d0$4008cad4@dose (view raw or flat)
Thread:
Lists: pgsql-novice
----- Original Message ----- 
From: "Wim" <wdh(at)belbone(dot)be>
To: "Sugrue, Sean" <Sean(dot)Sugrue(at)analog(dot)com>
Cc: <pgsql-novice(at)postgresql(dot)org>
Sent: Wednesday, February 18, 2004 8:55 AM
Subject: Re: [NOVICE] Big databases vs small databases

> If it is a table without indexes
> and constraints, it doesn't matter how big your DB is

AFAIK postgres adds an implicit B-tree index over the primary key to a table
that has no index. Rebuilding a B-Tree should take longer for a larger tree,
especally if newly added index keys are already sorted.

> I hope that I'm right, because these are only thoughts. I didn't perform
> any tests. The specialists may correct me if I'm wrong :-)

Same here. :-P

chris


In response to

pgsql-novice by date

Next:From: kynnDate: 2004-02-19 04:06:11
Subject: Cannot insert a duplicate key into unique index
Previous:From: Tom LaneDate: 2004-02-18 15:57:18
Subject: Re: Error: query is too long. Maximum length is 16382

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group