2 citations · 3 across the 6 of their papers we have counts for
6 papers
Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure (Full Version)
Adi Kaufman, Moshik Hershcovitch, Adam Morrison
Key-value stores typically leave access control to the systems for which they act as storage engines. Unfortunately, attackers may circumvent such read access controls via timing a…
Non-Volatile Memory Accelerated Geometric Multi-Scale Resolution Analysis
Andrew Wood, Moshik Hershcovitch, Daniel Waddington +5
Dimensionality reduction algorithms are standard tools in a researcher's toolbox. Dimensionality reduction algorithms are frequently used to augment downstream tasks such as machin…
Non-Volatile Memory Accelerated Posterior Estimation
Andrew Wood, Moshik Hershcovitch, Daniel Waddington +2
Bayesian inference allows machine learning models to express uncertainty. Current machine learning models use only a single learnable parameter combination when making predictions,…
A High-Performance Persistent Memory Key-Value Store with Near-Memory Compute
Daniel Waddington, Clem Dickey, Luna Xu +2
MCAS (Memory Centric Active Storage) is a persistent memory tier for high-performance durable data storage. It is designed from the ground-up to provide a key-value capability with…
An Architecture for Memory Centric Active Storage (MCAS)
Daniel Waddington, Clem Dickey, Moshik Hershcovitch +1
The advent of CPU-attached persistent memory technology, such as Intel's Optane Persistent Memory Modules (PMM), has brought with it new opportunities for storage. In 2018, IBM Res…
Minimal Indices for Successor Search
Sarel Cohen, Amos Fiat, Moshik Hershcovitch +1
We give a new successor data structure which improves upon the index size of the Pǎtraşcu-Thorup data structures, reducing the index size from bits to …