StarRing Big Data Open Lab
Oct 14, 2020 · Databases
How In-Memory Databases Organize Data and Indexes: Techniques and System Comparisons
This article explains how modern in‑memory database systems structure data into fixed‑ and variable‑length blocks, choose partitioned or non‑partitioned architectures, handle row versus column storage, and implement cache‑aware index structures such as CSB+-Tree, PB+-Tree, Bw‑Tree, Adaptive Radix, OLFIT and Skiplists, illustrated with Hekaton, H‑Store/VoltDB, HyPer and SAP HANA examples.
Partitioningdata organizationdatabase systems
0 likes · 22 min read
