Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
thezviad
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
thezviad
7y ago
the way to do is to pass context all the way through, until the other thing you are waiting on uses up no resources. so in your example it should be done like this: ch <- workFor(ctx, in) and the 'workFor' function should be th
2.
▲
by
thezviad
8y ago
Start of every new transaction does a scan of all connected sessions (including idle) ones. I am pretty sure this is true in 5.6 too, and most likely in newer versions too. So if the queries that you are issuing are large or the total conne
3.
▲
by
thezviad
8y ago
I am not as familiar with Postgres as with MySQL, but in this case they would most likely be similarly deficient. Databases like MySQL and Postgres have optimized on disk storage engines and query planners, but the other parts that are need
4.
▲
by
thezviad
8y ago
This article would be better if it was called "connection pool sizing for MySQL". If you had a better database, you would have to worry way less about configuring pool size on the clients. The proper way to do this would be for th
5.
▲
by
thezviad
10y ago
Good to see more leaderless consensus protocol implementations and that RAFT isn't be all and end all of all consensus problems. One advantage not mentioned in the article, of leader based consensus algorithms is the ability to more ea