( title, in case you don't know, comes from excellent “movie" about databases )
The secret ingredient is of course sharding.
Can we do sharding in PostgreSQL? First, let's define what sharding is:
Continue reading The secret ingredient in the webscale sauce
No Points Name Hp [max]
1 179310 depesz-Wiz-Hum-Fem-Cha died in The Dungeons of Doom
on level 22. Killed by a minotaur. - [94]Just released version 0.2.0 of OmniPITR. There is one important change – that is OmniPITR backup programs can now create checksum files for backups.
Details in docs, but the basic idea is that to all the other options to omnipitr-backup-{master,slave} we added (Phil Sorber to be exact) –digest option, which lets you specify that you want some checksums (md5, sha1, sha2).
Recently I had birthday, and I'd like to share one picture. My wife got me a cake. In shape of my currently favorite drink. All of it, including the label, was edible, and actually really good (a bit on the sweet side, but still good).
On 3rd of November, Heikki Linnakangas committed patch:
Support range DATA types. Selectivity estimation functions are missing FOR SOME range TYPE operators, which IS a TODO. Jeff Davis
As I wrote earlier, we (my wife and me) went to Maldives. This is brief summary, with some photos below.
This post is scheduled to appear on the web when we will be on our way.
I would like to express big gratitude to all of you who helped me with my plan. As far as I know right now (Monday, 10th of October) Ula still doesn't know about the surprise trip. Which should make for a nice effect on Wednesday on the airport.
Anyway – for those of you curious on where we're going: Maldives, Kuredu Resort/Island. When we'll be back I will probably have some pictures, but not sure about it as neither I nor Ula are big fans on making photos.
I hope it will will work out fine, the place seems nice, even though the weather forecast is not in favor of us. We'll see.
During this time I do not plan to check email, write blogposts (even in case of something big would get committed to PostgreSQL), so if you'd need to contact me for something – well, after 21st I should be back online.
Thanks again for all the help.
On 8th of October, Tom Lane committed patch:
Support index-only scans using the visibility map to avoid heap fetches. When a btree index contains all columns required by the query, and the visibility map shows that all tuples on a target heap page are visible-to-all, we don't need to fetch that heap page. This patch depends on the previous patches that made the visibility map reliable. There's a fair amount left to do here, notably trying to figure out a less chintzy way of estimating the cost of an index-only scan, but the core functionality seems ready to commit. Robert Haas and Ibrar Ahmed, with some previous work by Heikki Linnakangas.
Some time ago I wrote a blogpost about why index might not be used.
While this post seemed to be well received (top link from depesz.com on reddit), it doesn't answer another question – what index to create for given situation.
I'll try to cover this question now.
On 22nd of September, Tom Lane committed patch:
Make EXPLAIN ANALYZE report the numbers of rows rejected by filter steps. This provides information about the numbers of tuples that were visited but not returned by table scans, as well as the numbers of join tuples that were considered and discarded within a join plan node. There is still some discussion going on about the best way to report counts for outer-join situations, but I think most of what's in the patch would not change if we revise that, so I'm going to go ahead and commit it as-is. Documentation changes to follow (they weren't in the submitted patch either). Marko Tiikkaja, reviewed by Marc Cousin, somewhat revised by Tom
Continue reading Waiting for 9.2 – filtered info in explain analyze