On the public citation graph
Optimal Bloom Filters and Adaptive Merging for LSM-Trees
0 signed · 127 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/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/s002360050048openalex-snapshot
The log-structured merge-tree (LSM-tree)
inferredcites →https://doi.org/10.1007/s00453-003-1021-xopenalex-snapshot
The Buffer Tree: A Technique for Designing Batched External Data Structures
inferredcites →https://doi.org/10.1007/s00778-005-0171-7openalex-snapshot
The partitioned exponential file for database storage management
inferredcites →https://doi.org/10.1109/icde.2017.121openalex-snapshot
On Log-Structured Merge for Solid-State Drives
inferredcites →https://doi.org/10.1109/surv.2011.031611.00024openalex-snapshot
Theory and Practice of Bloom Filters for Distributed Systems
inferredcites →https://doi.org/10.1137/1.9781611977554openalex-snapshot
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1145/1248377.1248393openalex-snapshot
Cache-oblivious streaming B-trees
inferredcites →https://doi.org/10.1145/1807128.1807152openalex-snapshot
Benchmarking cloud serving systems with YCSB
inferredcites →https://doi.org/10.1145/1807167.1807194openalex-snapshot
Analyzing the energy efficiency of a database server
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/2699484openalex-snapshot
Online Updates on Data Warehouses via Judicious Use of Solid-State Storage
inferredcites →https://doi.org/10.1145/2741948.2741973openalex-snapshot
Scaling concurrent log-structured data stores
inferredcites →https://doi.org/10.1145/2882903.2912569openalex-snapshot
Design Tradeoffs of Data Access Methods
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.14778/1920841.1920990openalex-snapshot
Tree indexing on solid state drives
inferredcites →https://doi.org/10.14778/2757807.2757810openalex-snapshot
Compaction management in distributed key-value datastores
inferredcites →https://doi.org/10.14778/3137628.3137659openalex-snapshot
Fast scans on key-value stores
inferredcites →https://doi.org/10.5441/002/edbt.2016.42openalex-snapshot
Designing Access Methods: The RUM Conjecture
inferredcites →https://doi.org/10.5555/2591272.2591275openalex-snapshot
Building workload-independent storage with VT-trees
inferredcites →https://doi.org/10.5555/338219.338650openalex-snapshot
On external memory graph traversal
inferredcites →https://doi.org/10.5555/644108.644201openalex-snapshot
Lower bounds for external memory dictionaries
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.2799openalex-snapshot
Robust and efficient memory management in Apache AsterixDB
inferred← citeshttps://doi.org/10.1007/978-3-030-79478-1_32openalex-snapshot
The Entry-Extensible Cuckoo Filter
inferred← citeshttps://doi.org/10.1007/978-3-031-21047-1_33openalex-snapshot
Query Optimization in NoSQL Databases Using an Enhanced Localized R-tree Index
inferred← citeshttps://doi.org/10.1007/978-3-031-39821-6_20openalex-snapshot
Multi-core Adaptive Merging of the Secondary Index for LSM-Based Stores
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-7241-4_2openalex-snapshot
BIVXDB: A Bottom Information Invert Index to Speed up the Query Performance of LSM-Tree
inferred← citeshttps://doi.org/10.1007/s00778-019-00555-yopenalex-snapshot
LSM-based storage techniques: a survey
inferred← citeshttps://doi.org/10.1007/s00778-023-00826-9openalex-snapshot
Towards flexibility and robustness of LSM trees
inferred← citeshttps://doi.org/10.1007/s00778-024-00873-wopenalex-snapshot
Enabling space-time efficient range queries with REncoder
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/s12145-021-00574-wopenalex-snapshot
RDF for temporal data management – a survey
inferred← citeshttps://doi.org/10.1007/s44443-025-00306-wopenalex-snapshot
DWLBF: a deletable weighted learned Bloom Filter based on data temperature
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.is.2023.102267openalex-snapshot
Two-layer partitioned and deletable deep bloom filter for large-scale membership query
inferred← citeshttps://doi.org/10.1109/bigdata50022.2020.9377736openalex-snapshot
HotKey-LSM: A Hotness-Aware LSM-Tree for Big Data Storage
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00158openalex-snapshot
REncoder: A Space-Time Efficient Range Filter with Local Encoder
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/icde65706.2026.00194openalex-snapshot
Rangereduce: Query-Driven LSM Compactions
inferred← citeshttps://doi.org/10.1109/icdew67478.2025.00017openalex-snapshot
On-chip Acceleration for Log-Structured GDBMS
inferred← citeshttps://doi.org/10.1109/icpads51040.2020.00011openalex-snapshot
LTG-LSM: The Optimal Structure in LSM-tree Combined with Reading Hotness
inferred← citeshttps://doi.org/10.1109/jiot.2025.3567288openalex-snapshot
Enhancing Wireless Communication Security With Variable Bloom Filter-Based Physical-Layer Secure Transmission
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.2025.3600356openalex-snapshot
Bloom Merge Strategies for Sustainable SSD Endurance in Write-Intensive LSM-Trees
inferred← citeshttps://doi.org/10.1109/tcc.2023.3329646openalex-snapshot
Improving LSM-Tree Based Key-Value Stores With Fine-Grained Compaction Mechanism
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3528993openalex-snapshot
Poisoning Attacks and Defenses to Learned Bloom Filters for Malicious URL Detection
inferred← citeshttps://doi.org/10.1109/tkde.2022.3200045openalex-snapshot
On the Evolutionary of Bloom Filter False Positives - An Information Theoretical Approach to Optimizing Bloom Filter Parameters
inferred← citeshttps://doi.org/10.1145/3299869.3314034openalex-snapshot
From Auto-tuning One Size Fits All to Self-designed and Learned Data-intensive Systems
inferred← citeshttps://doi.org/10.1145/3299869.3319903openalex-snapshot
The Log-Structured Merge-Bush & the Wacky Continuum
inferred← citeshttps://doi.org/10.1145/3318464.3389757openalex-snapshot
Lethe: A Tunable Delete-Aware LSM Engine
inferred← citeshttps://doi.org/10.1145/3448016.3452806openalex-snapshot
Spatial Independent Range Sampling
inferred← citeshttps://doi.org/10.1145/3448016.3457273openalex-snapshot
Chucky: A Succinct Cuckoo Filter for LSM-Tree
inferred← citeshttps://doi.org/10.1145/3465998.3466002openalex-snapshot
Reducing Bloom Filter CPU Overhead in LSM-Trees on Modern Storage Devices
inferred← citeshttps://doi.org/10.1145/3514221.3517894openalex-snapshot
Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity
inferred← citeshttps://doi.org/10.1145/3514221.3522563openalex-snapshot
Dissecting, Designing, and Optimizing LSM-based Data Stores
inferred← citeshttps://doi.org/10.1145/3589285openalex-snapshot
InfiniFilter: Expanding Filters to Infinity and Beyond
inferred← citeshttps://doi.org/10.1145/3599724openalex-snapshot
Enabling Timely and Persistent Deletion in LSM-Engines
inferred← citeshttps://doi.org/10.1145/3626183.3660514openalex-snapshot
Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized Trees
inferred← citeshttps://doi.org/10.1145/3626246.3654681openalex-snapshot
Beyond Bloom: A Tutorial on Future Feature-Rich Filters
inferred← citeshttps://doi.org/10.1145/3626721openalex-snapshot
ChainedFilter: Combining Membership Filters by Chain Rule
inferred← citeshttps://doi.org/10.1145/3626744openalex-snapshot
Practical Dynamic Extension for Sampling Indexes
inferred← citeshttps://doi.org/10.1145/3639258openalex-snapshot
Grafite: Taming Adversarial Queries with Optimal Range Filters
inferred← citeshttps://doi.org/10.1145/3654962openalex-snapshot
Optimizing Time Series Queries with Versions
inferred← citeshttps://doi.org/10.1145/3725327openalex-snapshot
Mnemosyne: Dynamic Workload-Aware BF Tuning via Accurate Statistics in LSM trees
inferred← citeshttps://doi.org/10.1145/3746252.3761196openalex-snapshot
General Adaptive Memory Allocation for Learned Bloom Filters
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.1145/3788853.3803090openalex-snapshot
TDSQL-Boundless: A Distributed Database System for Large-scale Heterogeneous Multi-Table Workloads
inferred← citeshttps://doi.org/10.14778/3358701.3358707openalex-snapshot
Optimal column layout for hybrid workloads
inferred← citeshttps://doi.org/10.14778/3372716.3372719openalex-snapshot
On performance stability in LSM-based storage systems
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.14778/3659437.3659447openalex-snapshot
Oasis: An Optimal Disjoint Segmented Learned Range Filter
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/3685800.3685831openalex-snapshot
Lindorm-UWC: An Ultra-Wide-Column Database for Internet of Vehicles
inferred← citeshttps://doi.org/10.14778/3749646.3749667openalex-snapshot
DobLIX: A Dual-Objective Learned Index for Log-Structured Merge Trees
inferred← citeshttps://doi.org/10.14778/3773731.3773735openalex-snapshot
AXE: A Task Decomposition Approach to Learned LSM Tuning
inferred← citeshttps://doi.org/10.14778/3819518.3819523openalex-snapshot
Dynamic Read & Write Optimization with TurtleKV
inferred← citeshttps://doi.org/10.1561/1900000059openalex-snapshot
Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4105094/v1openalex-snapshot
A Version-aware Data Layout for Heterogeneous Workloads in In-Memory Database Systems
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4205982/v1openalex-snapshot
Scalable Version-aware Data Placement for In-Memory Databases
inferred← citeshttps://doi.org/10.32604/cmc.2022.029566openalex-snapshot
Key-Value Store Coupled with an Operating System for Storing Large-Scale燰alues
inferred← citeshttps://doi.org/10.48550/arxiv.1907.05443openalex-snapshot
Learning Key-Value Store Design
inferred← citeshttps://doi.org/10.48550/arxiv.2004.10360openalex-snapshot
Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2006.03176openalex-snapshot
Partitioned Learned Bloom Filter
inferred← citeshttps://doi.org/10.48550/arxiv.2006.04777openalex-snapshot
Lethe: A Tunable Delete-Aware LSM Engine (Updated Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2110.13801openalex-snapshot
Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty
inferred← citeshttps://doi.org/10.48550/arxiv.2111.06856openalex-snapshot
Approximate Membership Query Filters with a False Positive Free Set
inferred← citeshttps://doi.org/10.7287/peerj-cs.297v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Data in the time of COVID-19: a general methodology to select and secure a NoSQL DBMS for medical data (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.297v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Data in the time of COVID-19: a general methodology to select and secure a NoSQL DBMS for medical data (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.297v0.2/reviews/1openalex-snapshot
Peer Review #1 of "Data in the time of COVID-19: a general methodology to select and secure a NoSQL DBMS for medical data (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.297v0.3/reviews/1openalex-snapshot
Peer Review #1 of "Data in the time of COVID-19: a general methodology to select and secure a NoSQL DBMS for medical data (v0.3)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.297openalex-snapshot
Data in the time of COVID-19: a general methodology to select and secure a NoSQL DBMS for medical data
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.