2 ms·
Possibly relevant are these 2 great papers co-authored by Michael Stonebraker[1]: “One Size Fits All”: An Idea Whose Time Has Come and Gone[2] The End of an A
by mpweiher 9y ago
Possibly relevant are these 2 great papers co-authored by Michael Stonebraker[1]:
“One Size Fits All”: An Idea Whose Time Has Come and Gone[2]
The End of an Architectural Era (It’s Time for a Complete Rewrite)[3]
They basically show that classical RDBMs are inefficient by around a factor of at least 10 in every conceivable application. I tend to trade in a little of that for the kinds of dramatically simpler mechanisms discussed in TFA.
[1] https://en.wikipedia.org/wiki/Michael_Stonebraker https://en.wikipedia.org/wiki/Michael_Stonebraker
[2] https://cs.brown.edu/~ugur/fits_all.pdf https://cs.brown.edu/~ugur/fits_all.pdf
[3] http://cs-www.cs.yale.edu/homes/dna/papers/vldb07hstore.pdf http://cs-www.cs.yale.edu/homes/dna/papers/vldb07hstore.pdf
- everybodyknows 9y agoDo they identify any cases for which classical RDBMS are inefficient by a super-constant factor?
- mmalone 9y agoACID semantics subtley and indirectly requires locks. Any scenario where lock contention might be a problem would be a problem for an RDBMS (assuming the traditional definition of RDBMS as a ACID compliant). Those scenarios can easily be “super-constant”, especially if you have to distribute across multiple nodes. That requires locks that are held for the duration of an “external call” over the network which is A Bad Idea and could definitely be “super-constant”.