On the public citation graph
Building Efficient Key-Value Stores via a Lightweight Compaction Tree
0 signed · 75 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.
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.
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.2010.5496971openalex-snapshot
Indirection systems for shingled-recording disk drives
inferredcites →https://doi.org/10.1109/msst.2010.5496991openalex-snapshot
Design issues for a shingled write disk system
inferredcites →https://doi.org/10.1109/msst.2013.6558426openalex-snapshot
A novel I/O scheduler for SSD with improved performance and lifetime
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.2015.2435779openalex-snapshot
ForestDB: A Fast Key-Value Storage System for Variable-Length String Keys
inferredcites →https://doi.org/10.1109/tpds.2016.2609912openalex-snapshot
Building an Efficient Put-Intensive Key-Value Store with Skip-Tree
inferredcites →https://doi.org/10.1145/1060289openalex-snapshot
Proceedings of the 5th symposium on Operating systems design and implementation - OSDI '02
inferredcites →https://doi.org/10.1145/1807128.1807152openalex-snapshot
Benchmarking cloud serving systems with YCSB
inferredcites →https://doi.org/10.1145/2254756.2254766openalex-snapshot
Workload analysis of a large-scale key-value store
inferredcites →https://doi.org/10.1145/2318857.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/2592798.2592818openalex-snapshot
An aggressive worn-out flash block management scheme to alleviate SSD performance degradation
inferredcites →https://doi.org/10.1145/2741948.2741949openalex-snapshot
An efficient page-level FTL to optimize address translation in flash memory
inferredcites →https://doi.org/10.1145/2821511openalex-snapshot
Skylight—A Window on Shingled Disk Operation
inferredcites →https://doi.org/10.5555/1298455.1298475openalex-snapshot
Bigtable: a distributed storage system for structured data
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70914openalex-snapshot
DS ‐ LSM ‐Tree: SSTable ‐Decoupled LSM ‐Tree
inferred← citeshttps://doi.org/10.1007/978-3-030-95384-3_15openalex-snapshot
Parallel Cache Prefetching for LSM-Tree Based Store: From Algorithm to Evaluation
inferred← citeshttps://doi.org/10.1007/978-981-96-0579-8_18openalex-snapshot
REXIO: Indexing for Low Write Amplification by Reducing Extra I/Os in Key-Value Store Under Mixed Read/Write Workloads
inferred← citeshttps://doi.org/10.1007/978-981-97-2387-4_27openalex-snapshot
TrieKV: Managing Values After KV Separation to Optimize Scan Performance in LSM-Tree
inferred← citeshttps://doi.org/10.1007/978-981-97-8824-8_33openalex-snapshot
Minimum Resonant Current Control for Detuned WPT System with LCC-LCC Compensation
inferred← citeshttps://doi.org/10.1007/s00778-019-00555-yopenalex-snapshot
LSM-based storage techniques: a survey
inferred← citeshttps://doi.org/10.1007/s00778-024-00876-7openalex-snapshot
An update-intensive LSM-based R-tree index
inferred← citeshttps://doi.org/10.1007/s11227-024-06382-5openalex-snapshot
MTDB: an LSM-tree-based key-value store using a multi-tree structure to improve read performance
inferred← citeshttps://doi.org/10.1016/j.dcan.2025.08.003openalex-snapshot
A security authentication scheme for mobile industrial IoT supply chains based on blockchain and group key management
inferred← citeshttps://doi.org/10.1016/j.future.2024.05.050openalex-snapshot
SolsDB: Solve the Ethereum’s bottleneck caused by storage engine
inferred← citeshttps://doi.org/10.1016/j.sysarc.2022.102681openalex-snapshot
A storage computing architecture with multiple NDP devices for accelerating compaction performance in LSM-tree based KV stores
inferred← citeshttps://doi.org/10.1016/j.sysarc.2025.103465openalex-snapshot
ZoomDB: Building cost-effective key–value store engine on ZNS SSD and SMR HDD
inferred← citeshttps://doi.org/10.1109/access.2020.3016680openalex-snapshot
CaseDB: Lightweight Key-Value Store for Edge Computing Environment
inferred← citeshttps://doi.org/10.1109/access.2021.3098736openalex-snapshot
SFM: Mitigating Read/Write Amplification Problem of LSM-Tree-Based Key-Value Stores
inferred← citeshttps://doi.org/10.1109/asp-dac47756.2020.9045617openalex-snapshot
Towards Read-Intensive Key-Value Stores with Tidal Structure Based on LSM-Tree
inferred← citeshttps://doi.org/10.1109/bigdata59044.2023.10386222openalex-snapshot
Increase Merge Efficiency in LSM Trees Through Coordinated Partitioning of Sorted Runs
inferred← citeshttps://doi.org/10.1109/ccem53267.2021.00014openalex-snapshot
The Log Structured Merge Forest
inferred← citeshttps://doi.org/10.1109/cloud.2018.00090openalex-snapshot
Efficient Key-Value Stores with Ranged Log-Structured Merge Trees
inferred← citeshttps://doi.org/10.1109/dcabes52998.2021.00046openalex-snapshot
Improve the Performance of LSM-Tree based on Key-Value via Multithreading
inferred← citeshttps://doi.org/10.1109/icccbda64898.2025.11030438openalex-snapshot
Fine-Grained Dynamic Hardware Resource Usage Measurement for Distributed Key-Value Stores
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00171openalex-snapshot
Workload-Aware Log-Structured Merge Key-Value Store for NVM-SSD Hybrid Storage
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/icde65706.2026.00067openalex-snapshot
Deferred Flushing for Out-of-Order Arrivals in Apache IoTDB
inferred← citeshttps://doi.org/10.1109/icsess52187.2021.9522173openalex-snapshot
Improve the Performance of LSM-Tree Based Key-Value via Multiple Immutable MemTables
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00104openalex-snapshot
FlashKey:A High-Performance Flash Friendly Key-Value Store
inferred← citeshttps://doi.org/10.1109/jcice61382.2024.00024openalex-snapshot
HIndex-FLSM: Fragmented Log-Structured Merge Trees Integrated with Heat and Index
inferred← citeshttps://doi.org/10.1109/jiot.2021.3113994openalex-snapshot
MVLevelDB: Using Log-Structured Tree to Support Temporal Queries in IoT
inferred← citeshttps://doi.org/10.1109/tc.2023.3326982openalex-snapshot
SplitDB: Closing the Performance Gap for LSM-Tree-Based Key-Value Stores
inferred← citeshttps://doi.org/10.1109/tc.2025.3535832openalex-snapshot
RGKV: A GPGPU-Empowered Compaction Framework for LSM-Tree-Based KV Stores With Optimized Data Transfer and Parallel Processing
inferred← citeshttps://doi.org/10.1109/tcad.2020.2982623openalex-snapshot
Temperature-Aware Persistent Data Management for LSM-Tree on 3-D NAND Flash Memory
inferred← citeshttps://doi.org/10.1109/tcad.2022.3177575openalex-snapshot
Tidal-Tree-Mem: Toward Read-Intensive Key-Value Stores With Tidal Structure Based on LSM-Tree
inferred← citeshttps://doi.org/10.1109/tcad.2022.3197542openalex-snapshot
LLSM: A Lifetime-Aware Wear-Leveling for LSM-Tree on NAND Flash Memory
inferred← citeshttps://doi.org/10.1117/12.3056894openalex-snapshot
An efficient compaction scheme for LSM-based storage system via lightweight merges
inferred← citeshttps://doi.org/10.1145/3380905openalex-snapshot
SILK+ Preventing Latency Spikes in Log-Structured Merge Key-Value Stores Running Heterogeneous Workloads
inferred← citeshttps://doi.org/10.1145/3448016.3457273openalex-snapshot
Chucky: A Succinct Cuckoo Filter for LSM-Tree
inferred← citeshttps://doi.org/10.1145/3514221.3522563openalex-snapshot
Dissecting, Designing, and Optimizing LSM-based Data Stores
inferred← citeshttps://doi.org/10.1145/3617333openalex-snapshot
Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads
inferred← citeshttps://doi.org/10.1145/3633475openalex-snapshot
An LSM Tree Augmented with B + Tree on Nonvolatile Memory
inferred← citeshttps://doi.org/10.1145/3633782openalex-snapshot
gLSM: Using GPGPU to Accelerate Compactions in LSM-tree-based Key-value Stores
inferred← citeshttps://doi.org/10.1145/3654927openalex-snapshot
CaaS-LSM: Compaction-as-a-Service for LSM-based Key-Value Stores in Storage Disaggregated Infrastructure
inferred← citeshttps://doi.org/10.1145/3673038.3673153openalex-snapshot
HyperDB: a Novel Key Value Store for Reducing Background Traffic in Heterogeneous SSD Storage
inferred← citeshttps://doi.org/10.1145/3725344openalex-snapshot
Rethinking The Compaction Policies in LSM-trees
inferred← citeshttps://doi.org/10.1145/3786667openalex-snapshot
Making LSM-Tree-based Key-Value Store Practical and Efficient for Multi-Tenant Serverless Cloud Databases
inferred← citeshttps://doi.org/10.1186/s40537-025-01298-0openalex-snapshot
Enhancing LSM trees merge efficiency via coordinated sorted runs partitioning
inferred← citeshttps://doi.org/10.14778/3796195.3796208openalex-snapshot
ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads
inferred← citeshttps://doi.org/10.1631/fitee.2200496openalex-snapshot
MyWAL: performance optimization by removing redundant input/output stack in key-value store
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.