NVMe SSDs based on flash are cheap and offer high throughput. Combining several of
these devices into a single server enables 10 million I/O operations per second or more. Our …

Most database management systems cache pages from storage in a main memory buffer
pool. To do this, they either rely on a hash table that translates page identifiers into pointers …

This paper explores the intersection of operating systems and database systems, focusing
on the potential of specialized kernels for cloud-native database systems. Although the idea …

Two decades ago, one of us co-authored a paper commenting on the previous 40 years of
data modelling research and development [188]. That paper demonstrated that the relational …

A B-Tree is the most widely used range index for larger-than-memory data systems. It
organizes data in pages (usually 4 KB) that efficiently align with disk IO operations, fully …

The scaling of per-GB DRAM cost has slowed down in recent years. Recent research has
suggested that adding remote memory to a system can further reduce the overall memory …

For over forty years, researchers have demonstrated that operating system memory
managers often fall short in supporting memory-hungry applications. The problem is even …

Hash joins play a critical role in relational data processing and their performance is crucial
for the overall performance of a database system. Due to the hard to predict nature of …

Neither traditional disk-based database systems nor modern inmemory database systems
are capable of fully exploiting modern servers with multiple NVMe SSDs. LeanStore is a …

Most Database Management Systems (DBMSs) sup-port arbitrary-sized objects through the
Binary Large OBjects (BLOBs) data type. Nevertheless, application developers usually store …