Paper Reading: Adaptive Radix Tree - ARTful Indexing for Main-Memory Databases

Session Led by: Dharin Shah

Link to Paper: https://db.in.tum.de/\~leis/papers/ART.pdf

This paper reading session, we will deep dive into a in-memory optimized index structure, that leverages modern CPU caches to make IOPS faster, also allowing range queries.

Abstract—Main memory capacities have grown up to a point where most databases fit into RAM. For main-memory database systems, index structure performance is a critical bottleneck. Traditional in-memory data structures like balanced binary search trees are not efficient on modern hardware, because they do not optimally utilize on-CPU caches. Hash tables, also often used for main-memory indexes, are fast but only support point queries.