On the public citation graph

RACE: One-sided RDMA-conscious Extendible Hashing

0 signed · 49 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-3-540-87779-0_24openalex-snapshot
Hopscotch Hashing
inferredcites →https://doi.org/10.1016/j.jalgor.2003.12.002openalex-snapshot
Cuckoo hashing
inferredcites →https://doi.org/10.1109/71.963420openalex-snapshot
The power of two choices in randomized load balancing
inferredcites →https://doi.org/10.1109/hoti.2015.22openalex-snapshot
Intel® Omni-path Architecture: Enabling Scalable, High Performance Fabrics
inferredcites →https://doi.org/10.1109/hpca.2012.6168955openalex-snapshot
System-level implications of disaggregated memory
inferredcites →https://doi.org/10.1109/icdcs.2014.70openalex-snapshot
Lock-Free Cuckoo Hashing
inferredcites →https://doi.org/10.1109/icde.2018.00049openalex-snapshot
Easy Lock-Free Indexing in Non-Volatile Memory
inferredcites →https://doi.org/10.1145/1462166.1462167openalex-snapshot
Revisiting coroutines
inferredcites →https://doi.org/10.1145/1555754.1555789openalex-snapshot
Disaggregated memory for expansion and sharing in blade servers
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/2254756.2254766openalex-snapshot
Workload analysis of a large-scale key-value store
inferredcites →https://doi.org/10.1145/2540708.2540748openalex-snapshot
Meet the walkers
inferredcites →https://doi.org/10.1145/2592798.2592820openalex-snapshot
Algorithmic improvements for fast concurrent Cuckoo hashing
inferredcites →https://doi.org/10.1145/261124.261125openalex-snapshot
Transactional client-server cache consistency
inferredcites →https://doi.org/10.1145/2749469.2750416openalex-snapshot
Architecting to achieve a billion requests per second throughput on a single key-value store server platform
inferredcites →https://doi.org/10.1145/2785956.2787492openalex-snapshot
R2C2
inferredcites →https://doi.org/10.1145/2815400.2815419openalex-snapshot
Fast in-memory transaction processing using RDMA and HTM
inferredcites →https://doi.org/10.1145/3035918.3064015openalex-snapshot
Cicada
inferredcites →https://doi.org/10.1145/3132747.3132756openalex-snapshot
KV-Direct
inferredcites →https://doi.org/10.1145/3132747.3132762openalex-snapshot
LITE Kernel RDMA Support for Datacenter Applications
inferredcites →https://doi.org/10.1145/3152434.3152447openalex-snapshot
Tolerating Faults in Disaggregated Datacenters
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/3317550.3321433openalex-snapshot
Designing Far Memory Data Structures
inferredcites →https://doi.org/10.14778/2735508.2735511openalex-snapshot
Staring into the abyss
inferredcites →https://doi.org/10.14778/3430915.3430932openalex-snapshot
CoroBase

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-032-35251-4_41openalex-snapshot
Fast Checkpointing in Disaggregated Persistent Memory
inferred← citeshttps://doi.org/10.1007/s00778-024-00863-yopenalex-snapshot
Optimizing LSM-based indexes for disaggregated memory
inferred← citeshttps://doi.org/10.1007/s11227-025-07421-5openalex-snapshot
DPUSwap: building an infinite swap with DPU for cloud computing system
inferred← citeshttps://doi.org/10.1007/s11390-023-3272-0openalex-snapshot
Reinvent Cloud Software Stacks for Resource Disaggregation
inferred← citeshttps://doi.org/10.1109/hpca68181.2026.11408613openalex-snapshot
Pulse: Fine-Grained Hierarchical Hashing Index for Disaggregated Memory
inferred← citeshttps://doi.org/10.1109/hpcc67675.2025.00046openalex-snapshot
MMSEH: Metadata Management System Based on New Extendible Hash
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00134openalex-snapshot
Extendible RDMA-Based Remote Memory KV Store with Dynamic Perfect Hashing Index
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00212openalex-snapshot
Mirror Asymmetry Perfect Hashing: A Memory-Efficient and Load-Intensive-Optimized Hashing Index on Hybrid DRAM-PMem Architecture
inferred← citeshttps://doi.org/10.1109/ispa63168.2024.00038openalex-snapshot
DCF: A Dynamic Caching Framework for Compute Nodes on Disaggregated Memory
inferred← citeshttps://doi.org/10.1109/ispa63168.2024.00167openalex-snapshot
LBCB: One-sided RDMA-based Distributed B+ tree Index with Low Bandwidth Consumption
inferred← citeshttps://doi.org/10.1109/tcc.2026.3672997openalex-snapshot
Faunus: A Non-Blocking Distributed B + Tree Index for RDMA-Based Disaggregated Memory
inferred← citeshttps://doi.org/10.1109/tpds.2023.3332782openalex-snapshot
Enabling Efficient Erasure Coding in Disaggregated Memory Systems
inferred← citeshttps://doi.org/10.1145/3589276openalex-snapshot
Design Guidelines for Correct, Efficient, and Scalable Synchronization using One-Sided RDMA
inferred← citeshttps://doi.org/10.1145/3605573.3605576openalex-snapshot
Marlin: A Concurrent and Write-Optimized B+-tree Index on Disaggregated Memory
inferred← citeshttps://doi.org/10.1145/3673038.3673088openalex-snapshot
DiStore: A Fully Memory Disaggregation Friendly Key-Value Store with Improved Tail Latency and Space Efficiency
inferred← citeshttps://doi.org/10.1145/3716377openalex-snapshot
Synchronizing Disaggregated Data Structures with One-Sided RDMA: Pitfalls, Experiments and Design Guidelines
inferred← citeshttps://doi.org/10.1145/3736548.3737822openalex-snapshot
Efficient Vector Search on Disaggregated Memory with d-HNSW
inferred← citeshttps://doi.org/10.1145/3805634openalex-snapshot
d-HNSW: A High-performance Vector Search Engine on Disaggregated Memory
inferred← citeshttps://doi.org/10.1360/ssi-2023-0034openalex-snapshot
Progress on storage systems for disaggregated data centers
inferred← citeshttps://doi.org/10.14778/3749646.3749703openalex-snapshot
Sphinx: A Succinct Perfect Hash Index for x86
inferred← citeshttps://doi.org/10.1631/fitee.2200462openalex-snapshot
NEHASH: high-concurrency extendible hashing for non-volatile memory
inferred← citeshttps://doi.org/10.3390/electronics15102210openalex-snapshot
FPCache: A Fingerprint-Rectified Learned Index Cache for Disaggregated Memory
inferred← citeshttps://doi.org/10.52396/justc-2022-0125openalex-snapshot
Hybrid fault tolerance in distributed in-memory storage systems
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.