Live data from Hacker News

Pgagroal: High-performance connection pool for PostgreSQL

github.com

1–10 of 39 posts

Re: Pgagroal: High-performance connection pool for PostgreSQL

#5
post #4

"PostgreSQL's model of one process per connection doesn't scale, so let's build a connection pooler that uses one process per connection." Certainly sounds like a strange concept. How well does it scale with thousands of connections?

Not the author but PG connection scalability being blamed on per-process model is somewhat misunderstood. You can easily have many hundreds of thousands of processes, they are mostly equivalent to threads on Linux anyway (with some minor differences ofc).

Instead the poor scalability stems from the amount of resources allocated to each connection. If postgres was to switch to threads without changing this architecture it's likely scalability wouldn't be majorly improved.

By the same token a connection pooler that is fork based but only allocates a very small amount of resources per connection is still likely to a net win as it can do statement based pooling of a smaller number of postgres connections.

Re: Pgagroal: High-performance connection pool for PostgreSQL

#10
post #9

> This report describe pgagroal in relationship to 3 other PostgreSQL connection pool implementations, which we will call "a", "b" and "c". Why? Just why! Please put up names rather than saving faces for other poolers!

Also make the benchmark code open source, so that we can run it on our own hardware and judge it's relevancy.
Post reply on HN