On Thu, Mar 21, 2013 at 9:58 PM, Howard Chu <[email protected]> wrote: > Tobias Oberstein wrote: > >> Hello, >> >> I have read the - very interesting - performance comparison >> http://symas.com/mdb/**microbench/ <http://symas.com/mdb/microbench/> >> >> I'd like to ask if someone did benchmark LMDB (and/or the others) >> against http://www.garret.ru/fastdb.**html<http://www.garret.ru/fastdb.html> >> >> FastDB is an in-memory ACID database that works via shadow paging, and >> without a transaction log. >> > > OK, like LMDB it uses shadow root pages. I think the similarity ends there. > It is a relational database with an ASCII query language, while LMDB is > strictly a key/value store. That automatically means for simple get/put > operations LMDB will be orders of magnitude faster (just as it is so much > faster than SQLite3 and SQLite4). > I Not being so young, these considerations remind me of the same arguments that there was about hierarchical DBMS and the relational one. I do not mean that there are not still real, but just to tell that we are talking about topic 20 years old. Isn't it ?
Best Regards
