  In the last decade, key-value data storage systems have gained significantly
more interest from academia and industry. These systems face numerous
challenges concerning storage space- and read optimization. There exists a
large potential for improving current solutions by introducing new management
techniques and algorithms.
  In this paper we give an overview of the basic concept of key-value data
storage systems and provide an explanation for bottlenecks. Further we
introduce two new memory management algorithms and a improved index structure.
Finally, these solutions are compared to each other and discussed.
