On the public citation graph
Pipelined Compaction for the LSM-Tree
0 signed · 58 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.1007/s00778-005-0171-7openalex-snapshot
The partitioned exponential file for database storage management
inferredcites →https://doi.org/10.1145/1248377.1248393openalex-snapshot
Cache-oblivious streaming B-trees
inferredcites →https://doi.org/10.1145/1272743.1272747openalex-snapshot
Improving hash join performance through prefetching
inferredcites →https://doi.org/10.1145/2038916.2038917openalex-snapshot
An efficient multi-tier tablet server storage architecture
inferredcites →https://doi.org/10.1145/2254756.2254766openalex-snapshot
Workload analysis of a large-scale key-value store
inferredcites →https://doi.org/10.1145/2517349.2522722openalex-snapshot
An analysis of Facebook photo caching
inferredcites →https://doi.org/10.14778/1920841.1920990openalex-snapshot
Tree indexing on solid state drives
inferredcites →https://doi.org/10.5555/2591272.2591275openalex-snapshot
Building workload-independent storage with VT-trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-05051-1_7openalex-snapshot
A Priority and Fairness Mixed Compaction Scheduling Mechanism for LSM-tree Based KV-Stores
inferred← citeshttps://doi.org/10.1007/978-3-030-05677-3_6openalex-snapshot
KT-Store: A Key-Order and Write-Order Hybrid Key-Value Store with High Write and Range-Query Performance
inferred← citeshttps://doi.org/10.1007/978-3-031-00123-9_39openalex-snapshot
GHStore: A High Performance Global Hash Based Key-Value Store
inferred← citeshttps://doi.org/10.1007/978-981-92-5696-9_11openalex-snapshot
Grove: De-aging by Spawning a Tract of LSM-Trees
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/s10766-016-0472-zopenalex-snapshot
dCompaction: Delayed Compaction for the LSM-Tree
inferred← citeshttps://doi.org/10.1007/s11227-024-06680-yopenalex-snapshot
PMCKV: pipeline-based multi-compactions KV stores to improve the system performance
inferred← citeshttps://doi.org/10.1007/s11390-017-1704-4openalex-snapshot
dCompaction: Speeding up Compaction of the LSM-Tree via Delayed Compaction
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.04.011openalex-snapshot
Collaborative Compaction Optimization System using Near-Data Processing for LSM-tree-based Key-Value Stores
inferred← citeshttps://doi.org/10.1109/2575-8411.2026.00101openalex-snapshot
GBSI: A GPU-Based Secondary Indexing Mechanism for Write-Intensive Workloads
inferred← citeshttps://doi.org/10.1109/access.2018.2831259openalex-snapshot
FlameDB: A Key-Value Store With Grouped Level Structure and Heterogeneous Bloom Filter
inferred← citeshttps://doi.org/10.1109/access.2018.2873579openalex-snapshot
DStore: A Holistic Key-Value Store Exploring Near-Data Processing and On-Demand Scheduling for Compaction Optimization
inferred← citeshttps://doi.org/10.1109/access.2020.2985407openalex-snapshot
TLSM: Tiered Log-Structured Merge-Tree Utilizing Non-Volatile Memory
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/cloud.2018.00090openalex-snapshot
Efficient Key-Value Stores with Ranged Log-Structured Merge Trees
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00116openalex-snapshot
G-Match: A Fast GPU-Friendly Data Compression Algorithm
inferred← citeshttps://doi.org/10.1109/hpcc64274.2024.00035openalex-snapshot
A Window-Driven Compaction Mechanism in LSM-tree-based Key-Value Stores through Near-Data Processing
inferred← citeshttps://doi.org/10.1109/icct46805.2019.8947217openalex-snapshot
An Optimization of Key-Value Store Based on Segmented LSM-Tree
inferred← citeshttps://doi.org/10.1109/icde.2019.00070openalex-snapshot
LDC: A Lower-Level Driven Compaction Method to Optimize SSD-Oriented Key-Value Stores
inferred← citeshttps://doi.org/10.1109/icde48307.2020.00113openalex-snapshot
FPGA-based Compaction Engine for Accelerating LSM-tree Key-Value Stores
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/icde60146.2024.00298openalex-snapshot
STEM: Streaming-Based FPGA Acceleration for Large-Scale Compactions in LSM KV
inferred← citeshttps://doi.org/10.1109/icmc60390.2024.00013openalex-snapshot
ALSM: An Attribute-Aware LSM-Tree Based Key-Value Store to Reduce I/O Amplification
inferred← citeshttps://doi.org/10.1109/icpads67057.2025.11323134openalex-snapshot
GCLComp: A GPU-Centric Compaction Strategy for LSM-Based KV Store
inferred← citeshttps://doi.org/10.1109/ispass69572.2026.00033openalex-snapshot
A Comprehensive Study of Performance Degradation for Diverse Intensive Workloads in RocksDB
inferred← citeshttps://doi.org/10.1109/tc.2015.2417539openalex-snapshot
Rotated Logging Storage Architectures for Data Centers: Models and Optimizations
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/tkde.2020.3019264openalex-snapshot
Adaptive Lower-level Driven Compaction to Optimize LSM-Tree Key-Value Stores
inferred← citeshttps://doi.org/10.1109/tpds.2016.2609912openalex-snapshot
Building an Efficient Put-Intensive Key-Value Store with Skip-Tree
inferred← citeshttps://doi.org/10.1109/tpds.2025.3586616openalex-snapshot
GPComp: Using GPU and SSD-GPU Peer to Peer DMA to Accelerate LSM-Tree Compaction for Key-Value Store
inferred← citeshttps://doi.org/10.1145/3337821.3337855openalex-snapshot
Near-Data Processing-Enabled and Time-Aware Compaction Optimization for LSM-tree-based Key-Value Stores
inferred← citeshttps://doi.org/10.1145/3605573.3605601openalex-snapshot
RBC: A bandwidth controller to reduce write-stalls and tail latency
inferred← citeshttps://doi.org/10.1145/3626097openalex-snapshot
Asynchronous Compaction Acceleration Scheme for Near-data Processing-enabled LSM-tree-based KV Stores
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/3754598.3754675openalex-snapshot
Revisiting Multi-threaded Compaction in LSM-trees: Enabling Compaction Pipelining
inferred← citeshttps://doi.org/10.1145/3799980openalex-snapshot
GDH+: A GPGPU-Empowered Gradient Data Hierarchy and Key-Value Separation for Optimizing LSM-Tree-Based KV Stores
inferred← citeshttps://doi.org/10.14778/3681954.3681977openalex-snapshot
On Reducing Space Amplification with Multi-Column Compaction in Apache IoTDB
inferred← citeshttps://doi.org/10.14778/3681954.3682012openalex-snapshot
Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index
inferred← citeshttps://doi.org/10.1631/fitee.2200496openalex-snapshot
MyWAL: performance optimization by removing redundant input/output stack in key-value store
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2142066/v1openalex-snapshot
SplitDB: Building a large-scale key-value store based on LSM-tree by split operations
inferred← citeshttps://doi.org/10.3390/electronics12204280openalex-snapshot
Requirements and Trade-Offs of Compression Techniques in Key–Value Stores: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.2004.03054openalex-snapshot
LUDA: Boost LSM Key Value Store Compactions with GPUs
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.