Server hardware is about to drastically change. As typified by emerging hardware such as
UC Berkeley's Firebox project and by Intel's Rack-Scale Architecture (RSA), next generation …

When a working set fits into memory, the overhead imposed by the buffer pool renders
traditional databases non-competitive with in-memory designs that sacrifice the benefits of a …

The increasing number of cores every generation poses challenges for high-performance in-
memory database systems. While these systems use sophisticated high-level algorithms to …

Introduced in 2007, TPC-E is the most recently standardized OLTP benchmark by TPC. Even
though TPC-E has already been around for six years, it has not gained the popularity of its …

Modern implementations of DBMS software are intended to take advantage of high core
counts that are becoming common in high-end servers. However, we have observed that …

When a dirty victim page is selected for replacement upon page miss, the buffer manager
has to first flush the dirty victim to the storage before reading the missing page. This …

An earlier survey of modern b-tree techniques is now over a decade old. Obviously, it lacks
descriptions of techniques invented and published during this time. Just as importantly, it …

Flash-memory-based solid-state drives (SSDs) are used widely for secondary storage. To be
effective for SSDs, traditional indices have to be redesigned to cope with the special …

In databases with a large buffer pool, a transaction may run in less time than it takes to log
the transaction's commit record on stable storage. Such cases motivate a technique called …

Adaptive indexing initializes and optimizes indexes incrementally, as a side effect of query
processing. The goal is to achieve the benefits of indexes while hiding or minimizing the …