It’s really too bad that it’s only got two zones. At least that means Paris is going to have three so that there are two EU regions with three zones (there was an AWS blog post a couple of weeks ago that mentioned the total number of zones in EU and there were five in total unaccounted for).
This should probably include “(2008)” in the title, it’s old enough that “the old way” has been new and then old again, again.
Perhaps you have already done this but you can suggest titles for the story. Here is a direct link.
It’s funny when RDBMS proponents rack down on NoSQL for not being “durable” or not “being ACID”, when in fact, most RDBMS, including Postgres aren’t either.
I found this presentation to be mostly FUD and misunderstandings about what the things they talked about mean. I’m sure the Postgres things are correct, but the first half of the presentation was mostly misinformation about other ways of storing data. It’s easy to be consistent when there’s only one copy of your data – but to say that something that stores only a single copy of the data is “durable” when one that replicates it is not, then what do you even mean by “durable”?
I’m sure Postgres' HStore and JSON columns are very useful if you’re already using Postgres, and for things where a relational model is useful (on the fly aggregations of small data sets, for example), and Postgres replication story seems to have gotten better lately. I just find it silly and unhelpful to bash NoSQL for things like “not being ACID”, when you include a slide like #24 and say “by the way, if you need better performance, you can turn off that pesky durability, just like those fast NoSQL systems”. Why do you think those NoSQL systems exist in the first place?
to say that something that stores only a single copy of the data is “durable” when one that replicates it is not, then what do you even mean by “durable”?
That’s easily answerable by looking up what durability means in the context of ACID. It means that, once a commit succeeds, the changes are not lost in case of system-level outage.
This is actually really cool. I’d love to see a proof of concept, maybe forking and changing libketama to see how it works with memcached?
Guava has a Java implementation of the algorithm, that’s how I found the paper. Someone on the Guava mailing list asked about the code and if there was any background on the algorithm.
Great point! I’m using 0x1F as field separator all the time when building cache keys or similar things, it’s much better than using , - / or other printables since that’s bound to break sooner or later.
There’s a few screenshots in the repositories.
Those look very much like SublimeText with the Soda and amCoder themes.