On the public citation graph

When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories

https://doi.org/10.1145/3588959
0 signed · 55 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/978-1-4842-4932-1openalex-snapshot
Programming Persistent Memory: A Comprehensive Guide for Developers
inferredcites →https://doi.org/10.1016/j.jalgor.2003.12.002openalex-snapshot
Cuckoo hashing
inferredcites →https://doi.org/10.1109/icde.2013.6544812openalex-snapshot
The adaptive radix tree: ARTful indexing for main-memory databases
inferredcites →https://doi.org/10.1109/icde.2013.6544834openalex-snapshot
The Bw-Tree: A B-tree for new hardware platforms
inferredcites →https://doi.org/10.1109/jproc.2017.2731776openalex-snapshot
Platform Storage Performance With 3D XPoint Technology
inferredcites →https://doi.org/10.1109/micro50266.2020.00049openalex-snapshot
Characterizing and Modeling Non-Volatile Memory Systems
inferredcites →https://doi.org/10.1109/tii.2019.2916689openalex-snapshot
BIM Big Data Storage in WebVRGIS
inferredcites →https://doi.org/10.1137/1.9781611976007.14openalex-snapshot
RecSplit: Minimal Perfect Hashing via Recursive Splitting
inferredcites →https://doi.org/10.1145/1233307.1233309openalex-snapshot
Concurrent programming without locks
inferredcites →https://doi.org/10.1145/1807128.1807152openalex-snapshot
Benchmarking cloud serving systems with YCSB
inferredcites →https://doi.org/10.1145/2168836.2168855openalex-snapshot
Cache craftiness for fast multicore key-value storage
inferredcites →https://doi.org/10.1145/2517349.2522713openalex-snapshot
Speedy transactions in multicore in-memory databases
inferredcites →https://doi.org/10.1145/2592798.2592814openalex-snapshot
System software for persistent memory
inferredcites →https://doi.org/10.1145/2694344.2694387openalex-snapshot
DEUCE
inferredcites →https://doi.org/10.1145/2723372.2742797openalex-snapshot
Spark SQL
inferredcites →https://doi.org/10.1145/2872362.2872392openalex-snapshot
NVWAL
inferredcites →https://doi.org/10.1145/2882903.2915222openalex-snapshot
Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes
inferredcites →https://doi.org/10.1145/2882903.2915251openalex-snapshot
FPTree
inferredcites →https://doi.org/10.1145/2983990.2984019openalex-snapshot
Makalu: fast recoverable allocation of non-volatile memory
inferredcites →https://doi.org/10.1145/3183713.3196896openalex-snapshot
HOT
inferredcites →https://doi.org/10.1145/3187009.3164147openalex-snapshot
Bztree
inferredcites →https://doi.org/10.1145/319628.319663openalex-snapshot
Efficient locking for concurrent operations on B-trees
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/321479.321481openalex-snapshot
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
inferredcites →https://doi.org/10.1145/3276523openalex-snapshot
Object-oriented recovery for non-volatile memory
inferredcites →https://doi.org/10.1145/3299869.3300075openalex-snapshot
Efficiently Searching In-Memory Sorted Arrays
inferredcites →https://doi.org/10.1145/3341301.3359628openalex-snapshot
KVell
inferredcites →https://doi.org/10.1145/3381898.3397212openalex-snapshot
Understanding and optimizing persistent memory allocation
inferredcites →https://doi.org/10.1145/3445814.3446730openalex-snapshot
Clobber-NVM: log less, re-execute more
inferredcites →https://doi.org/10.1145/3447786.3456237openalex-snapshot
ChameleonDB
inferredcites →https://doi.org/10.1145/3448016.3457245openalex-snapshot
Index-Accelerated Pattern Matching in Event Stores
inferredcites →https://doi.org/10.1145/3483840openalex-snapshot
RocksDB: Evolution of Development Priorities in a Key-value Store Serving Large-scale Applications
inferredcites →https://doi.org/10.1145/828.1884openalex-snapshot
Storing a Sparse Table with 0 (1) Worst Case Access Time
inferredcites →https://doi.org/10.1147/rd.524.0465openalex-snapshot
Phase-change random access memory: A scalable technology
inferredcites →https://doi.org/10.14778/2752939.2752947openalex-snapshot
Persistent B + -trees in non-volatile main memory
inferredcites →https://doi.org/10.14778/3025111.3025116openalex-snapshot
Write-behind logging
inferredcites →https://doi.org/10.14778/3137628.3137629openalex-snapshot
Memory management techniques for large-scale persistent-main-memory systems
inferredcites →https://doi.org/10.14778/3372716.3372717openalex-snapshot
DPTree
inferredcites →https://doi.org/10.14778/3384345.3384355openalex-snapshot
LB+Trees
inferredcites →https://doi.org/10.14778/3389133.3389134openalex-snapshot
Dash
inferredcites →https://doi.org/10.14778/3402707.3402719openalex-snapshot
PALM
inferredcites →https://doi.org/10.14778/3415478.3415483openalex-snapshot
PiBench online
inferredcites →https://doi.org/10.14778/3514061.3514066openalex-snapshot
NBTree

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.70522openalex-snapshot
A Cache Friendly LSM Tree Based on Extendible Hash
inferred← citeshttps://doi.org/10.1007/978-981-95-5716-5_25openalex-snapshot
WROTree: Write and Range Query Optimal Tree in Persistent Memory
inferred← citeshttps://doi.org/10.1007/s41019-026-00356-8openalex-snapshot
HIACS: A High-Performance Hybrid Index Structure Combining ART and Skip List for Non- Volatile Memory Storage Devices
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00060openalex-snapshot
Reconfiguring Scalable Hashing with Persistent CPU Caches
inferred← citeshttps://doi.org/10.1109/isctis65944.2025.11065324openalex-snapshot
An Adaptive Split Index Scheme for In-Memory Database Systems
inferred← citeshttps://doi.org/10.1109/sgai69026.2026.11565989openalex-snapshot
Distributed Metric Collection Task Scheduling Optimization Using Temporal Convolutional Network with Multi-Source Feature Fusion
inferred← citeshttps://doi.org/10.1109/tc.2026.3726609openalex-snapshot
High-Performance and Cache-Efficiency Adaptive Radix Tree for Disaggregated Memory
inferred← citeshttps://doi.org/10.1145/3694906.3743321openalex-snapshot
Reconciling Hardware Transactional Memory and Persistent Programming with Buffered Durability
inferred← citeshttps://doi.org/10.1145/3698801openalex-snapshot
Buffered Persistence in B+ Trees
inferred← citeshttps://doi.org/10.1145/3806051openalex-snapshot
SRIndex: Bridging the Last Mile between Learned-Index Scalability and Workload Dynamics for Memory Pooling Systems
inferred← citeshttps://doi.org/10.1145/3841175openalex-snapshot
Learned Indices for String Keys with Optimized Performance and O(N) Space Cost
inferred← citeshttps://doi.org/10.14778/3681954.3682010openalex-snapshot
LITS: An Optimized Learned Index for Strings
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.