Indexes are models: a\btree-Index can be seen as a model to map a key to the position of a
record within a sorted array, a Hash-Index as a model to map a key to a position of a record …

Predicting personalized sequential behavior is a key task for recommender systems. In order
to predict user actions such as the next product to purchase, movie to watch, or place to visit …

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 …

FaSST is an RDMA-based system that provides distributed in-memory transactions with
serializability and durability. Existing RDMA-based transaction processing systems use one …

Byte-addressable persistent memory (PM) brings hash tables the potential of low latency,
cheap persistence and instant recovery. The recent advent of Intel Optane DC Persistent …

Hybrid memory systems consisting of DRAM and Non-Volatile Memory are promising to
persist data fast. The index design of existing key-value stores for hybrid memory fails to …

Index structures are one of the most important tools that DBAs leverage to improve the
performance of analytics and transactional workloads. However, building several indexes …

Persistent memory (PM) is fundamentally changing the way database index structures are
built by enabling persistence, high performance, and (near) instant recovery all on the …

RDMA (Remote Direct Memory Access) has gained considerable interests in network-
attached in-memory key-value stores. However, traversing the remote tree-based index in …

Index structures in memory systems become important to improve the entire system
performance. The promising learned indexes leverage deep-learning models to …