45 citations · 84 across the 8 of their papers we have counts for
5 papers · 1 filter
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…
On the Performance and Convergence of Distributed Stream Processing via Approximate Fault Tolerance
Zhinan Cheng, Qun Huang, Patrick P. C. Lee
Fault tolerance is critical for distributed stream processing systems, yet achieving error-free fault tolerance often incurs substantial performance overhead. We present AF-Stream,…
Binary MDS Array Codes with Optimal Repair
Hanxu Hou, Patrick P. C. Lee
Consider a binary maximum distance separable (MDS) array code composed of an array of bits with information columns and parity columns, such that any ou…
A New Design of Binary MDS Array Codes with Asymptotically Weak-Optimal Repair
Hanxu Hou, Yunghsiang Han, Patrick P. C. Lee +2
Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundan…
Rack-Aware Regenerating Codes for Data Centers
Hanxu Hou, Patrick P. C. Lee, Kenneth W. Shum +1
Erasure coding is widely used for massive storage in data centers to achieve high fault tolerance and low storage redundancy. Since the cross-rack communication cost is often high,…