ArcadeDB vs. InterSystems Caché vs. LevelDB vs. SQL Server Data Access Components Comparison Chart

Manage complex models using ArcadeDB without any compromise. Forget about Polyglot Persistence. no need for multiple databases. You can store graphs, documents, key values and time series all in one ArcadeDB Multi-Model database. Since each model is native to the database engine, you don't have to worry about translations slowing you down. ArcadeDB's engine was built with Alien Technology. It's able to crunch millions of records per second. With ArcadeDB, the traversing speed is not affected by the database size. It is always constant, whether your database has a few records or billions. ArcadeDB can work as an embedded database, on a single server and can scale up using multiple servers with Kubernetes. Flexible enough to run on any platform with a small footprint. Your data is secure. Our unbreakable fully transactional engine assures durability for mission-critical production databases. ArcadeDB uses a Raft Consensus Algorithm to maintain consistency across multiple servers.

LevelDB is a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values. Keys and values are arbitrary byte arrays. Data is stored sorted by key. Callers can provide a custom comparison function to override the sort order. Multiple changes can be made in one atomic batch. Users can create a transient snapshot to get a consistent view of data. Forward and backward iteration is supported over the data. Data is automatically compressed using the Snappy compression library. External activity (file system operations etc.) is relayed through a virtual interface so users can customize the operating system interactions. We use a database with a million entries. Each entry has a 16 byte key, and a 100 byte value. Values used by the benchmark compress to about half their original size. We list the performance of reading sequentially in both the forward and reverse direction, and also the performance of a random lookup.