We present the first learned index that supports predecessor, range queries and updates
within provably efficient time and space bounds in the worst case. In the (static) context of …

We present Recipe, a principled approach for converting concurrent DRAM indexes into
crash-consistent indexes for persistent memory (PM). The main insight behind Recipe is that …

Non-Volatile Memory (NVM), which provides relatively fast and byte-addressable
persistence, is now commercially available. However, we cannot equate a real NVM with a …

Disk-based database systems use buffer managers in order to transparently manage data
sets larger than main memory. This traditional approach is effective at minimizing the …

© 2020, VLDB Endowment. Deterministic databases are able to efficiently run transactions
across different replicas without coordination. However, existing state-of-the-art deterministic …

We present the Height Optimized Trie (HOT), a fast and space-efficient in-memory index
structure. The core algorithmic idea of HOT is to dynamically vary the number of bits …

In this paper, we propose ScaleStore, a novel distributed storage engine that exploits DRAM
caching, NVMe storage, and RDMA networking to achieve high performance, cost-efficiency …

Non-volatile main memory (NVMM) technologies promise byte addressability and near-
DRAM access that allows developers to build persistent applications with common load and …

In order to scale, future systems will need to dramatically reduce data movement. Data
movement is expensive in current designs because (i) traditional memory hierarchies force …

Recently, numerous promising results have shown that updatable learned indexes can
perform better than traditional indexes with much lower memory space consumption. But it is …