From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
---|---|
To: | "Tony Wasson" <ajwasson(at)gmail(dot)com> |
Cc: | "Jim C(dot) Nasby" <jnasby(at)pervasive(dot)com>, "Jorge Godoy" <jgodoy(at)gmail(dot)com>, pgsql-general(at)postgresql(dot)org |
Subject: | Re: [SQL] (Ab)Using schemas and inheritance |
Date: | 2006-05-24 03:08:58 |
Message-ID: | 25040.1148440138@sss.pgh.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general pgsql-sql |
"Tony Wasson" <ajwasson(at)gmail(dot)com> writes:
> $.02 about lots of schemas.
> I worked with an application that had 500 schemas and that worked very
> well. However, as the number of schemas exceeeded 8000 the query speed
> started to degrade. Running \d with a single schema in your search
> path took a few seconds with that many schemas. Queries that were
> running in 100ms were now taking about 600ms.
Note that this probably says more about \d than about anything else.
I can believe that having a large number of schemas listed in your
search path would suck, but there's not a good reason for lots of
schemas unrelated to your session to cause you any great pain.
(\d does some searching that might be impacted by lots of schemas,
but that doesn't say ordinary queries would be.)
If you've got a counterexample please file a bug with details ...
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | George Pavlov | 2006-05-24 04:57:20 | Re: assymetry updating a boolean (=FALSE faster than =TRUE) |
Previous Message | nuno | 2006-05-24 02:54:58 | column order |
From | Date | Subject | |
---|---|---|---|
Next Message | Alban Hertroys | 2006-05-24 09:09:38 | Re: [SQL] (Ab)Using schemas and inheritance |
Previous Message | Jorge Godoy | 2006-05-24 01:37:03 | Re: [SQL] (Ab)Using schemas and inheritance |