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 …

I/O latency and throughput are two of the major performance bottlenecks for disk-based
database systems. Persistent memory (PMem) technologies, like Intel's Optane DC …

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 …

Hashing is a fundamental operation in database management, playing a key role in the
implementation of numerous core database data structures and algorithms. Traditional hash …

Modern database engines must well use multicore CPUs, large main memory and fast
storage devices to achieve high performance. A common theme is hiding latencies such that …

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 …

By 2006, C++ had been in widespread industrial use for 20 years. It contained parts that had
survived unchanged since introduced into C in the early 1970s as well as features that were …

The Internet of Things (IoT) combines large data centers with (mobile, networked) edge
devices that are constrained both in compute power and energy budget. Modern edge …