> These indexes often are just a sequence of ordered entries, but new entries are added in random order. This means that from time to time, you need to sort the

> These indexes often are just a sequence of ordered entries, but new entries are added in random order. This means that from time to time, you need to sort the index. This seems like a crude index. Why didn't they start out using B-epsilon (Bε) trees [0]? > The indexes we use in the TezEdge v1.15 only store references to the commits special objects in the storage ... They are small enough to be completely loaded and sorted in-memory ... If they can store their index in RAM then why did they write a custom storage engine? Why don't they just use Postgres? [0] https://news.ycombinator.com/item?id=29403320 https://news.ycombinator.com/item?id=29403320