Query processing on smart ssds: Opportunities and challenges

J Do, YS Kee, JM Patel, C Park, K Park… - Proceedings of the 2013 …, 2013 - dl.acm.org
Data storage devices are getting" smarter." Smart Flash storage devices (aka" Smart SSD")
are on the horizon and will package CPU processing and DRAM storage inside a Smart …

Garbage collection and wear leveling for flash memory: Past and future

MC Yang, YM Chang, CW Tsao… - … on Smart Computing, 2014 - ieeexplore.ieee.org
Recently, storage systems have observed a great leap in performance, reliability,
endurance, and cost, due to the advance in non-volatile memory technologies, such as …

LSM-based storage techniques: a survey

C Luo, MJ Carey - The VLDB Journal, 2020 - Springer
Recently, the log-structured merge-tree (LSM-tree) has been widely adopted for use in the
storage layer of modern NoSQL systems. Because of this, there have been a large number …

{NV-Tree}: reducing consistency cost for {NVM-based} single level systems

J Yang, Q Wei, C Chen, C Wang, KL Yong… - 13th USENIX Conference …, 2015 - usenix.org
The non-volatile memory (NVM) has DRAM-like performance and disk-like persistency
which make it possible to replace both disk and DRAM to build single level systems. To keep …

Monkey: Optimal navigable key-value store

N Dayan, M Athanassoulis, S Idreos - Proceedings of the 2017 ACM …, 2017 - dl.acm.org
In this paper, we show that key-value stores backed by an LSM-tree exhibit an intrinsic trade-
off between lookup cost, update cost, and main memory footprint, yet all existing designs …

Dostoevsky: Better space-time trade-offs for LSM-tree based key-value stores via adaptive removal of superfluous merging

N Dayan, S Idreos - Proceedings of the 2018 International Conference …, 2018 - dl.acm.org
In this paper, we show that all mainstream LSM-tree based key-value stores in the literature
and in industry are suboptimal with respect to how they trade off among the I/O costs of …

The {CacheLib} caching engine: Design and experiences at scale

B Berg, DS Berger, S McAllister, I Grosof… - … USENIX Symposium on …, 2020 - usenix.org
Web services rely on caching at nearly every layer of the system architecture. Commonly,
each cache is implemented and maintained independently by a distinct team and is highly …

[PDF][PDF] Consistent and durable data structures for {Non-Volatile}{Byte-Addressable} memory

S Venkataraman, N Tolia, P Ranganathan… - … USENIX Conference on …, 2011 - usenix.org
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 …

Gem^ 2-tree: A gas-efficient structure for authenticated range queries in blockchain

C Zhang, C Xu, J Xu, Y Tang… - 2019 IEEE 35th …, 2019 - ieeexplore.ieee.org
Blockchain technology has attracted much attention due to the great success of the
cryptocurrencies. Owing to its immutability property and consensus protocol, blockchain …

FAWN: A fast array of wimpy nodes

DG Andersen, J Franklin, M Kaminsky… - Proceedings of the …, 2009 - dl.acm.org
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 …