On the public citation graph

gLSM: Using GPGPU to Accelerate Compactions in LSM-tree-based Key-value Stores

0 signed · 51 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/s10766-016-0472-zopenalex-snapshot
dCompaction: Delayed Compaction for the LSM-Tree
inferredcites →https://doi.org/10.1088/1742-6596/664/9/092010openalex-snapshot
The Effect of NUMA Tunings on CPU Performance
inferredcites →https://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
inferredcites →https://doi.org/10.1109/hpca.2017.15openalex-snapshot
KAML: A Flexible, High-Performance Key-Value SSD
inferredcites →https://doi.org/10.1109/icde48307.2020.00113openalex-snapshot
FPGA-based Compaction Engine for Accelerating LSM-tree Key-Value Stores
inferredcites →https://doi.org/10.1109/icde51399.2021.00125openalex-snapshot
WipDB: A Write-in-place Key-value Store that Mimics Bucket Sort
inferredcites →https://doi.org/10.1109/ipdps.2014.85openalex-snapshot
Pipelined Compaction for the LSM-Tree
inferredcites →https://doi.org/10.1109/ispass.2012.6189209openalex-snapshot
Characterizing and evaluating a key-value store application on heterogeneous CPU-GPU systems
inferredcites →https://doi.org/10.1109/tkde.2020.3019264openalex-snapshot
Adaptive Lower-level Driven Compaction to Optimize LSM-Tree Key-Value Stores
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.1109/tpds.2022.3149003openalex-snapshot
FenceKV: Enabling Efficient Range Query for Key-Value Separation
inferredcites →https://doi.org/10.1111/j.1467-8659.2009.01542.xopenalex-snapshot
Fast Four‐Way Parallel Radix Sorting on GPUs
inferredcites →https://doi.org/10.1145/2254756.2254766openalex-snapshot
Workload analysis of a large-scale key-value store
inferredcites →https://doi.org/10.1145/2451116.2451169openalex-snapshot
GPUfs
inferredcites →https://doi.org/10.1145/2508834.2513149openalex-snapshot
NUMA (Non-Uniform Memory Access): An Overview
inferredcites →https://doi.org/10.1145/2591971.2592002openalex-snapshot
GDM
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/3064176.3064193openalex-snapshot
FloDB
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/3267809.3267829openalex-snapshot
SifrDB
inferredcites →https://doi.org/10.1145/3299869.3314041openalex-snapshot
X-Engine
inferredcites →https://doi.org/10.1145/3337821.3337855openalex-snapshot
Near-Data Processing-Enabled and Time-Aware Compaction Optimization for LSM-tree-based Key-Value Stores
inferredcites →https://doi.org/10.14778/1920841.1920990openalex-snapshot
Tree indexing on solid state drives
inferredcites →https://doi.org/10.23919/date.2018.8342070openalex-snapshot
KVSSD: Close integration of LSM trees and flash translation layer for write-efficient KV store

What points at this work

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

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.2026.108425openalex-snapshot
C2LSM: A configuration paradigm for efficient compaction in LSM-tree-based key-value stores
inferred← citeshttps://doi.org/10.1016/j.parco.2026.103213openalex-snapshot
A critical-warp and cache-locality-aware warp scheduling policy for GPGPU
inferred← citeshttps://doi.org/10.1016/j.sysarc.2025.103342openalex-snapshot
ProckStore: An NDP-empowered key-value store with asynchronous and multi-threaded compaction scheme for optimized performance
inferred← citeshttps://doi.org/10.1016/j.sysarc.2025.103549openalex-snapshot
A+Store: An Asynchronous Parallel Compaction for Multi-NDP-Enabled Key–Value Store
inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103924openalex-snapshot
Mosaic: Breaking the single-path bottleneck in KV store scalability via foreground–background decoupled multi-path dataflows
inferred← citeshttps://doi.org/10.1109/cloud62652.2024.00054openalex-snapshot
Coordinating Compaction Between LSM-Tree Based Key-Value Stores for Edge Federation
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/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.00306openalex-snapshot
The Evolution of LSM-Tree Key-Value Stores: A Tutorial on State-Of-The-Art and Future Directions
inferred← citeshttps://doi.org/10.1109/icdew67478.2025.00017openalex-snapshot
On-chip Acceleration for Log-Structured GDBMS
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/ipdps64566.2025.00065openalex-snapshot
KVACCEL: A Novel Write Accelerator for LSM-Tree-Based KV Stores with Host-SSD Collaboration
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.2025.3591410openalex-snapshot
A ReRAM-Based Processing-in-Memory Framework for LSM-Based Key-Value Store
inferred← citeshttps://doi.org/10.1109/tkde.2026.3699948openalex-snapshot
Reducing I/O Amplification for Key-Value Stores With a Log-Assisted Log-Structured Merge 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.1109/tpds.2026.3696772openalex-snapshot
Near-Data Compaction for LSM Tree on Rack-Scale Disaggregated Storage
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/3712285.3759896openalex-snapshot
gParaKV: A GPGPU-accelerated Key-Value Separation-based KV Store with Optimized Compaction and Garbage Collection
inferred← citeshttps://doi.org/10.1145/3725284openalex-snapshot
DFlush: DPU-Offloaded Flush for Disaggregated LSM-based Key-Value Stores
inferred← citeshttps://doi.org/10.1145/3744568openalex-snapshot
JMStore: Joint Optimization of Computation and Storage Balancing in Multi-NDP Key-Value Stores with Hash-Based Data Distribution
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/3819518.3819529openalex-snapshot
Kirin: Efficient In-Storage Learned Compaction for LSM-Trees via System-Algorithm Co-Design
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.