12 citations · 22 across the 13 of their papers we have counts for
3 papers · 1 filter
Leveraging I/O Stalls for Efficient Scheduling in ANNS
Juncheng Zhang, Yuanming Ren, Yongkun Li +1
Disk-based graph indexes for approximate nearest neighbor search (ANNS) must serve latency-sensitive queries and throughput-demanding updates concurrently. We observe that over 40%…
FOCUS: Boosting Schema-aware Access for KV Stores via Hierarchical Data Management
Zhen Liu, Wenzhe Zhu, Yongkun Li +1
Persistent key-value (KV) stores are critical infrastructure for data-intensive applications. Leveraging high-performance Non-Volatile Memory (NVM) to enhance KV stores has gained…
Enabling Efficient Updates in KV Storage via Hashing: Design and Performance Evaluation
Yongkun Li, Helen H. W. Chan, Patrick P. C. Lee +1
Persistent key-value (KV) stores mostly build on the Log-Structured Merge (LSM) tree for high write performance, yet the LSM-tree suffers from the inherently high I/O amplification…