A Database featuring red-black trees as its indexing.
Every element is inserted in the table as a row of data, and each value of the row is stored in the indexing for the according column. With the red-black tree, the running time of modifying and searching in the database is O(nlogn).
- https://zhuanlan.zhihu.com/p/31805309
- CLRS(Introduction to Algorithms), Chapter 13