4 ms·
@antirez as in any mathematical proof the most generic case is considered first. If X is a special case or is exposing special corner scenarios, I'd assume that
by alexpopescu 16y ago
@antirez as in any mathematical proof the most generic case is considered first. If X is a special case or is exposing special corner scenarios, I'd assume that could be covered by extension proofs.
I'm not saying Erik's article is bullet proof. But it offers a very interesting perspective on two data models that were considered conflicting.
- stephth 16y agoBut should Redis really be part of that list? I feel like the strongest point of Redis is that it realistically allows devs to forget about any complex relational models living outside of the code logic, like the ones referred in the article. Other "NoSql" databases look like Redis, but the huge difference with the latter are its atomic operations on simple data structures (append, inc, push, intersect, union …). Redis is the only database that I know of that safely allows the developer to deal with relational data in such a straightforward, close-to-programming manner, and still talk with it at a pretty low level (without having to use mapper abstractions). The "data structure server" description probably serves the project better than "key-value store" in that sense.
- antirez 16y agowant to consider the most generic case? Don't mention Redis as it is not a KV store from the point of view of the mathematical model proposed inside the article.