https://github.com/rurban/

E.g. I preferred hashtables as database in phpwiki. There I needed sorted pagination, but even without btree's the simple server-less hashtable architecture was 20x faster than mysql/sqlite with its overhead. Also, why logarithmic btree's when you can have constant lookup. Not everything needs to be sorted.