To: Alessandro Baretta <a.baretta@studio.baretta.com>
cc: pgsql-performance@postgresql.org
Subject: Re: NAMEDATALEN and performance 
In-reply-to: <456FEE09.40905@studio.baretta.com> 
References: <456D6FAB.4030400@studio.baretta.com>
	<19764.1164815445@sss.pgh.pa.us>
	<456FEE09.40905@studio.baretta.com>
Comments: In-reply-to Alessandro Baretta <a.baretta@studio.baretta.com>
	message dated "Fri, 01 Dec 2006 09:55:37 +0100"
Date: Fri, 01 Dec 2006 10:16:17 -0500
Message-ID: <15880.1164986177@sss.pgh.pa.us>
From: Tom Lane <tgl@sss.pgh.pa.us>

Alessandro Baretta <a.baretta@studio.baretta.com> writes:
> ... I would like to receive some 
> insight on the implications of such a choice. Beside the fact that the parser 
> has more work to do to decipher queries and whatnot, what other parts of the 
> server would be stressed by a verbose naming scheme? Where should I expect the 
> bottlenecks to be?

I suppose the thing that would be notable is bloat in the size of the
system catalogs and particularly their indexes; hence extra I/O.

> Also, I could imagine a solution where I split the names in a schema part and a 
> local name, thereby refactoring my namespace. I'd get the approximate effect of 
> doubling namedatalen, but at the expense of having a much wider searchpath. 

This might be worth thinking about, simply because it'd avoid the need
for custom executables.

			regards, tom lane