“Introducing Badger: A fast key-value store written purely in Go” blog post describes why it was decided to write completely new key value storage for Dgraph which is better suited for SSD and stores values separated from keys (WiscKey).
As I understand the query to Badger has logarithmic time cost.
Neo4j claims that they have the Node Store that allows speedy lookup by ID, by calculating the offset in the node store.
Would not it be better to compose a storage for Dgraph similar to Neo4j with constant time access?
Is it possible to use the similar to Neo4j approach in distributed data storage?