The Bloom filter provides fast approximate set membership while using little memory.
Engineers often use these filters to avoid slow operations such as disk or network accesses …

Database systems use many pointer-based data structures, including hash tables and B+-
trees, which require extensive" pointer-chasing." Each pointer dereference, eg, during a …

Many systems are designed to run graph algorithms efficiently in memory but they achieve
only cache efficiency or work efficiency. We tackle this fundamental trade-off in existing …

Non-Volatile Memory (NVM) technologies exhibit 4X the read access latency of conventional
DRAM. When the working set does not fit in the processor cache, this latency gap between …

Data stalls are a major overhead in main-memory database engines due to the use of
pointer-rich data structures. Lightweight coroutines ease the implementation of software …

In order to improve their power efficiency and computational capacity, modern servers are
adopting hardware accelerators, especially GPUs. Modern analytical DMBS engines have …

Database architecture, while having been studied for four decades now, has delivered only
a few designs with well-understood properties. These few are followed by most actual …

Modern applications employ key-value stores (KVS) in at least some point of their software
stack, often as a caching system or a storage manager. Many of these applications also …

Data encoding has been applied to database systems for decades as it mitigates bandwidth
bottlenecks and reduces storage requirements. But even in the presence of these …

As random walk is a powerful tool in many graph processing, mining and learning
applications, this paper proposes an efficient inmemory random walk engine named …