High hit ratio.Dgraph is built like a search engine. Queries are broken into sub-queries, which run concurrently to achieve low-latency and high throughput.
Fast throughput.We use a variety of techniques for managing contention and the result is excellent throughput.
Fully concurrent.You can use as many goroutines as you want with little throughput degradation.
Cost-based eviction.Any large new item deemed valuable can evict multiple smaller items (cost could be anything).