On the public citation graph

SILK+ Preventing Latency Spikes in Log-Structured Merge Key-Value Stores Running Heterogeneous Workloads

https://doi.org/10.1145/3380905
0 signed · 52 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/s002360050048openalex-snapshot
The log-structured merge-tree (LSM-tree)
inferredcites →https://doi.org/10.1109/msst.2015.7208288openalex-snapshot
Atlas: Baidu's key-value storage system for cloud data
inferredcites →https://doi.org/10.1109/tc.2011.108openalex-snapshot
Locality-Sensitive Bloom Filter for Approximate Membership Query
inferredcites →https://doi.org/10.1109/tc.2015.2435779openalex-snapshot
ForestDB: A Fast Key-Value Storage System for Variable-Length String Keys
inferredcites →https://doi.org/10.1109/tpds.2005.38openalex-snapshot
Workload-aware load balancing for clustered Web servers
inferredcites →https://doi.org/10.1145/1773912.1773922openalex-snapshot
Cassandra
inferredcites →https://doi.org/10.1145/1807128.1807152openalex-snapshot
Benchmarking cloud serving systems with YCSB
inferredcites →https://doi.org/10.1145/2213836.2213862openalex-snapshot
bLSM
inferredcites →https://doi.org/10.1145/2254756.2254766openalex-snapshot
Workload analysis of a large-scale key-value store
inferredcites →https://doi.org/10.1145/2592798.2592804openalex-snapshot
An efficient design and implementation of LSM-tree based key-value store on open-channel SSD
inferredcites →https://doi.org/10.1145/2741948.2741973openalex-snapshot
Scaling concurrent log-structured data stores
inferredcites →https://doi.org/10.1145/2798729openalex-snapshot
BetrFS
inferredcites →https://doi.org/10.1145/2987550.2987563openalex-snapshot
Job-aware Scheduling in Eagle
inferredcites →https://doi.org/10.1145/3035918.3064054openalex-snapshot
Monkey
inferredcites →https://doi.org/10.1145/3064176.3064193openalex-snapshot
FloDB
inferredcites →https://doi.org/10.1145/3064176.3064209openalex-snapshot
Rein
inferredcites →https://doi.org/10.1145/3127479.3127486openalex-snapshot
LSM-tree managed storage for large-scale key-value store
inferredcites →https://doi.org/10.1145/3132747.3132765openalex-snapshot
PebblesDB
inferredcites →https://doi.org/10.1145/3139922openalex-snapshot
Building Efficient Key-Value Stores via a Lightweight Compaction Tree
inferredcites →https://doi.org/10.1145/3183713.3196927openalex-snapshot
Dostoevsky
inferredcites →https://doi.org/10.1145/3186728.3164142openalex-snapshot
Concurrent log-structured memory for many-core key-value stores
inferredcites →https://doi.org/10.1145/3232559openalex-snapshot
Amdahl's law for tail latency
inferredcites →https://doi.org/10.1145/3267809.3267829openalex-snapshot
SifrDB
inferredcites →https://doi.org/10.1145/3267809.3267838openalex-snapshot
Kairos
inferredcites →https://doi.org/10.1145/3341301.3359628openalex-snapshot
KVell
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1145/378420.378792openalex-snapshot
Analysis of SRPT scheduling
inferredcites →https://doi.org/10.1145/65762.65765openalex-snapshot
Beating the I/O bottleneck: a case for log-structured file systems
inferredcites →https://doi.org/10.14778/2757807.2757810openalex-snapshot
Compaction management in distributed key-value datastores
inferredcites →https://doi.org/10.14778/3151106.3151108openalex-snapshot
SlimDB
inferredcites →https://doi.org/10.14778/3229863.3229873openalex-snapshot
Accordion

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s10951-023-00803-8openalex-snapshot
A scheduling framework for distributed key-value stores and its application to tail latency minimization
inferred← citeshttps://doi.org/10.1109/ccem53267.2021.00014openalex-snapshot
The Log Structured Merge Forest
inferred← citeshttps://doi.org/10.1109/cluster48925.2021.00070openalex-snapshot
Supporting Elastic Compaction of LSM-tree with a FaaS Cluster
inferred← citeshttps://doi.org/10.1109/hpcc-smartcity-dss50907.2020.00118openalex-snapshot
sxKV: A Novel Secured and Bidirectional Key-Value Data Structure
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00094openalex-snapshot
CruiseDB: An LSM-Tree Key-Value Store with Both Better Tail Throughput and Tail Latency
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00258openalex-snapshot
PM-Blade: A Persistent Memory Augmented LSM-tree Storage for Database
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00273openalex-snapshot
The LSM Design Space and its Read Optimizations
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00044openalex-snapshot
Range Cache: An Efficient Cache Component for Accelerating Range Queries on LSM - Based Key-Value Stores
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00016openalex-snapshot
CSD-CoKV: Host-CSD Collaborative Offloading for High-Performance LSM-Tree Based KV Stores
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00129openalex-snapshot
Tetris: Lightweight Hyperparameter Auto-Tuning for Mitigating Performance Spikes in LSM-KVS
inferred← citeshttps://doi.org/10.1145/3459637.3481913openalex-snapshot
Elastic and Stable Compaction for LSM-tree
inferred← citeshttps://doi.org/10.1145/3583780.3614944openalex-snapshot
Khronos: A Real-Time Indexing Framework for Time Series Databases on Large-Scale Performance Monitoring Systems
inferred← citeshttps://doi.org/10.1145/3588195.3592982openalex-snapshot
Closing the Performance Gap between Leveling and Tiering Compaction via Bundle Compaction
inferred← citeshttps://doi.org/10.1145/3627535.3638477openalex-snapshot
Locks as a Resource: Fairly Scheduling Lock Occupation with CFL
inferred← citeshttps://doi.org/10.1145/3695873openalex-snapshot
SuccinctKV: a CPU-efficient LSM-tree Based KV Store with Scan-based Compaction
inferred← citeshttps://doi.org/10.1145/3722224openalex-snapshot
Maintaining Inter-Layer Equilibrium in Hierarchical-Storage-based KV Store
inferred← citeshttps://doi.org/10.1145/3764588openalex-snapshot
RBC: A Randomness-Resistant Block-Grained Compaction Strategy for ZNS SSDs
inferred← citeshttps://doi.org/10.1145/3805687.3806260openalex-snapshot
Compaction Size and Tail Latency in LSM-based Key-Value Stores
inferred← citeshttps://doi.org/10.14778/3430915.3430926openalex-snapshot
Toward a better understanding and evaluation of tree structures on flash SSDs
inferred← citeshttps://doi.org/10.14778/3476249.3476274openalex-snapshot
Constructing and analyzing the LSM compaction design space
inferred← citeshttps://doi.org/10.5441/002/edbt.2021.65openalex-snapshot
DLC: A New Compaction Scheme for LSM-tree with High Stability and Low Latency
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.