An Ordered Key-Value Store (OKVS) is a type of data storage paradigm that can support multi-model database.
The origin of Ordered Key-Value Store stems from the work of Ken Thompson on dbm in 1979.
Later in 1991, Berkeley DB was released that featured a B-Tree backend that allowed the keys to stay sorted.
Another notable use of OKVS paradigm is the multi-model database system called ArangoDB[3] based on RocksDB.
There are algorithms that encode basic data types (boolean, string, number) and composition of those data types inside sorted containers (tuple, list, vector) that preserve their natural ordering.
Denormalization, as in, repeating the same piece of data in multiple subspace is common practice.