Seeking Fastest Hash-Based NoSQL Database: GDBM vs Kyoto Cabinet & Other Alternatives

# Background I'm currently researching fast, hash-based key-value NoSQL databases for [my use case](https://stackoverflow.com/questions/78986903) , which requires high performance. I was surprised by the limited availability of benchmarks, particularly for GDBM. Despite being a long-established library, I found little comparative data on its performance, especially against other key-value databases like Kyoto Cabinet. # Questions 1. **Performance of GDBM vs Kyoto Cabinet:** Has anyone come across reliable benchmarks that compare GDBM's speed to Kyoto Cabinet's? Specifically, I'm interested in ingestion and lookup speeds for large datasets. 2. **Faster Alternatives:** Are there any other key-value, hash-based NoSQL databases that you've found to outperform these two in terms of speed? If so, could you point me to specific benchmarks or sources? # Requirements The database needs to meet the following criteria: - **Corruption resistance:** Safe from data corruption in case of power failure or unexpected shutdown. - **Concurrency:** Support for multiple users (multiple readers with one writer at the same time). - **Capacity:** Able to handle a few million key-value pairs efficiently. - **Bindings:** must have bindings for the C language. # Research I've gathered some relevant links and partial benchmarks, but there's a gap in comprehensive or head-to-head comparisons between GDBM and other hash-based systems: - ...benchmarks of some embedded databases with Python - Are there any known benchmarks/statistics on UnQLite? - Kyoto Cabinet ingestion rate measurement - HaloDB against RocksDB and KyotoCabinet - LevelDB vs Kyoto Cabinet my findings I'm looking for data beyond these sources, particularly regarding hash engines, and would appreciate any insights or references to benchmarks that are directly related to GDBM, Kyoto Cabinet, or other alternatives.