Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper
Query: lsm - trie : an lsm - tree - based ultra - large key - value store for small data items .
The log-structured merge-tree (LSM-tree)
Concerto: A High Concurrency Key-Value Store with Integrity
Replication and Data Placement in Distributed Key-Value Stores
HiKV: a hybrid index key-value store for DRAM-NVM memory systems
Tightly Packed Tries: How to Fit Large Models into Memory, and Make them Load Fast, Too
BloomStore: Bloom-Filter based memory-efficient key-value store for indexing of data deduplication on flash
Memory management for billions of small objects in a distributed in-memory storage
A flexible hash table design for 10GBPS key-value stores on FPGAS
Using one-sided RDMA reads to build a fast, CPU-efficient key-value store
Fast Scans on Key-Value Stores
A One-Year Perspective on Exposed In-memory Key-Value Stores
L-Store: A Real-time OLTP and OLAP System
KAML: A Flexible, High-Performance Key-Value SSD
KVFTL: Optimization of storage space utilization for key-value-specific flash storage devices
H-Tree: An efficient index structure for event matching in publish/subscribe systems
Efficient In-Memory Indexing with Generalized Prefix Trees.
Wormhole: A Fast Ordered Index for In-memory Data Management
NVHT: an efficient key-value storage library for non-volatile memory
The hB-tree: a multiattribute indexing method with good guaranteed performance
Fast and compact hash tables for integer keys
Irrigation management system with micro-controller application
Neuropsychological, Behavioral, and Academic Sequelae of Cleft: Early Developmental, School Age, and Adolescent/Young Adult Outcomes
The TokuFS Streaming File System
Opening black box Data Mining models using Sensitivity Analysis
Discovering microRNAs from deep sequencing data using miRDeep