The rise of functional programming might not be accelerated by the pain of impedance matching to RDBMSs. Converting between the relational and OO models of data

The rise of functional programming might not be accelerated by the pain of impedance matching to RDBMSs. Converting between the relational and OO models of data is a time-consuming pain. If this is widely realized, it could give FP a boost. >> Is the Relational Database Doomed? Ah, linkbait! Sorry, no sale. Using a (pre-compiled) stored procedure to do a key value lookup will likely be about as fast as a lookup in a key/value DB. In any case, it's easier to add a key/value lookup capability to an RDBMS than it is to add efficient query capabilities to a KVDB. The article focuses on scaling, which is rarely an issue. KVDBs win on simplicity and flexibility (no need to pre-define a data model) and a better impedance match with OOPLs. RDBMSs crush on querying, which most (though not all) applications need.