Re: Scalability with large numbers of tables
От | Greg Sabino Mullane |
---|---|
Тема | Re: Scalability with large numbers of tables |
Дата | |
Msg-id | ec19d00ae2c5f8583641d1a3b7115abc@biglumber.com обсуждение исходный текст |
Ответ на | Re: Scalability with large numbers of tables (Christopher Browne <cbbrowne@acm.org>) |
Ответы |
Re: Scalability with large numbers of tables
|
Список | pgsql-general |
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Phil Endecott wrote: > For example I find that tab-completion in psql is now unusably slow ... Christopher Browne replied: > If you've got tens of thousands of relations, the tab completion code > has to draw the whole list of relations from pg_class into memory and > "marshal" it into a form usable by GNU Readline. Well, it's actually not quite that bad. The tab-completion code has a hard-coded limit (literally) of 1000 relations in the SQL it sends to the backend, so over 1000 any slowdown is simply a limitation on how fast Postgres can execute the query and serve it up to psql. - -- Greg Sabino Mullane greg@turnstep.com PGP Key: 0x14964AC8 200502211216 http://biglumber.com/x/web?pk=2529DF6AB8F79407E94445B4BC9B906714964AC8 -----BEGIN PGP SIGNATURE----- iD8DBQFCGhmavJuQZxSWSsgRAvCbAJ9mKvfuJ0Es8U6Mzl+xRQoVeAAsjACdF0gN oXklUXpX9Vhs57KS3CGk3uY= =/6Yx -----END PGP SIGNATURE-----
В списке pgsql-general по дате отправления: