Yinlong Xu
where else to find them
no profile links on file
what they talk about
all 5 in the filters
where they keep going back
no series more than once — all 11 in the filters
on a stage with
all 54 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| DMTree: Towards Efficient Tree Indexing on Disaggregated Memory via Compute-side... | FAST '26 | 2026-02-24 |
Prototype DMTree implements a compute-side collaborative B‑tree: leaf nodes keep key/value entries and per‑leaf fingerprint tables whose addresses live in… | ||
| FineMem: Breaking the Allocation Overhead vs. Memory Waste Dilemma in Fine-Grained... | OSDI '25 | 2025-07-07 |
FineMem implements an RDMA-based remote allocator that removes MR registration from the allocation path via per-compute-node pre-registered MRs and isolates… | ||
| Mitigating Resource Usage Dependency in Sorting-based KV Stores on Hybrid... | USENIX ATC '25 | 2025-07-07 |
DecouKV decouples sorting into index merge tasks and data append and data flush tasks by separating indexes (stored in a mergeable skip list) from values… | ||
| MinFlow: High-performance and Cost-efficient Data Passing for I/O-intensive Stateful... | 22nd USENIX Conference on File and Storage Technologies (FAST '24) | 2024-02-27 |
MinFlow is a prototype framework that constructs progressively converging multi-level shuffle topologies, partitions the DAG into interleaved bipartite… | ||
| Revitalizing the Forgotten On-Chip DMA to Expedite Data Movement in NVM-based Storage | FAST '23: 21st USENIX Conference on File and Storage Technologies | 2023-02-21 |
Claims that reviving the on-chip DMA plus CPU cooperation cuts DRAM↔NVM data-movement cost and lowers the I/O size threshold (reads benefit above ~32 KB… | ||
| DEPART: Replica Decoupling for Distributed Key-Value Storage | FAST '22 | 2022-02-22 |
DEPART implements replica decoupling by storing primaries in an LSM and redundant copies in a separate two-layer log with tunable ordering, implemented as a… | ||
| Differentiated Key-Value Storage Management for Balanced I/O Performance | USENIX ATC '21 | 2021-07-14 |
DiffKV builds a prototype on TiKV/Titan that splits keys and values and uses a V3 multi-level value tree plus fine-grained KV separation (small/medium/large)… | ||
| SpanDB: A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage | FAST '21 | 2021-02-23 |
SpanDB adapts RocksDB to put write-ahead logs and the top LSM levels on a small NVMe while keeping bulk SSTables on cheaper SSDs, implements SPDK for polling… | ||
| Work-in-Progress Reports (WiPs) | FAST '21 | 2021-02-23 |
Seven short systems results: an application‑local user‑space library filesystem for persistent memory shares VM pages, omits ACLs, and in single‑process… | ||
| GraphWalker: An I/O-Efficient and Resource-Friendly Graph Analytic System... | USENIX ATC '20 | 2020-07-15 |
System design claims an state-aware I/O model plus asynchronous walk updating and block-centric indexing that let a single 64 GB machine with RAID‑0 SSDs… | ||
| SelectiveEC: Selective Reconstruction in Erasure-coded Storage Systems | 12th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage '20) | 2020-07-13 |
SelectiveEC is a balanced scheduling module that picks which erasure-coded stripes to rebuild and which source and replacement nodes to use, builds bipartite… | ||
| ElasticBF: Elastic Bloom Filter with Hotness Awareness for Boosting Read Performance in Large Key-Value Stores | USENIX ATC '19 | 2019-07-10 |
ElasticBF: Elastic Bloom Filter with Hotness Awareness for Boosting Read Performance in Large Key-Value Stores
Yongkun Li, Chengjin Tian, Fan Guo, Cheng Li… | ||
| nothing matches | ||