[PDF][PDF] Consistent and durable data structures for {Non-Volatile}{Byte-Addressable} memory
The predicted shift to non-volatile, byte-addressable memory (eg, Phase Change Memory
and Memristor), the growth of “big data”, and the subsequent emergence of frameworks such …
and Memristor), the growth of “big data”, and the subsequent emergence of frameworks such …
FAWN: A fast array of wimpy nodes
This paper presents a new cluster architecture for low-power data-intensive computing.
FAWN couples low-power embedded CPUs to small amounts of local flash storage, and …
FAWN couples low-power embedded CPUs to small amounts of local flash storage, and …
Gem^ 2-tree: A gas-efficient structure for authenticated range queries in blockchain
Blockchain technology has attracted much attention due to the great success of the
cryptocurrencies. Owing to its immutability property and consensus protocol, blockchain …
cryptocurrencies. Owing to its immutability property and consensus protocol, blockchain …
Indexing in flash storage devices: a survey on challenges, current approaches, and future trends
Indexes are special purpose data structures, designed to facilitate and speed up the access
to the contents of a file. Indexing has been actively and extensively investigated in DBMSes …
to the contents of a file. Indexing has been actively and extensively investigated in DBMSes …
Tree indexing on solid state drives
Large flash disks, or solid state drives (SSDs), have become an attractive alternative to
magnetic hard disks, due to their high random read performance, low energy consumption …
magnetic hard disks, due to their high random read performance, low energy consumption …
Lazy-adaptive tree: An optimized index structure for flash devices
Flash memories are in ubiquitous use for storage on sensor nodes, mobile devices, and
enterprise servers. However, they present significant challenges in designing tree indexes …
enterprise servers. However, they present significant challenges in designing tree indexes …
Internal parallelism of flash memory-based solid-state drives
A unique merit of a solid-state drive (SSD) is its internal parallelism. In this article, we
present a set of comprehensive studies on understanding and exploiting internal parallelism …
present a set of comprehensive studies on understanding and exploiting internal parallelism …
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic
hard disks, while offering comparable sequential read and write bandwidth. Because of their …
hard disks, while offering comparable sequential read and write bandwidth. Because of their …
Purity: Building fast, highly-available enterprise flash storage from commodity components
Although flash storage has largely replaced hard disks in consumer class devices,
enterprise workloads pose unique challenges that have slowed adoption of flash …
enterprise workloads pose unique challenges that have slowed adoption of flash …
Engineering a high-performance GPU B-Tree
We engineer a GPU implementation of a B-Tree that supports concurrent queries (point,
range, and successor) and updates (insertions and deletions). Our B-tree outperforms the …
range, and successor) and updates (insertions and deletions). Our B-tree outperforms the …