188 citations · 192 across the 7 of their papers we have counts for
7 papers
AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
David Torres Ramos, Vihan Lakshman, Chen Luo +2
We study the problem of building space-efficient, in-memory indexes for massive key-value datasets with highly skewed value distributions. This challenge arises in many data-intens…
DynaHash: Efficient Data Rebalancing in Apache AsterixDB (Extended Version)
Chen Luo, Michael J. Carey
Parallel shared-nothing data management systems have been widely used to exploit a cluster of machines for efficient and scalable data processing. When a cluster needs to be dynami…
Efficiently Reclaiming Space in a Log Structured Store
David Lomet, Chen Luo
A log structured store uses a single write I/O for a number of diverse and non-contiguous pages within a large buffer instead of using a write I/O for each page separately. This re…
Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems (Extended Version)
Chen Luo, Michael J. Carey
Log-Structured Merge-trees (LSM-trees) have been widely used in modern NoSQL systems. Due to their out-of-place update design, LSM-trees have introduced memory walls among the memo…
On Performance Stability in LSM-based Storage Systems (Extended Version)
Chen Luo, Michael J. Carey
The Log-Structured Merge-Tree (LSM-tree) has been widely adopted for use in modern NoSQL systems for its superior write performance. Despite the popularity of LSM-trees, they have…
LSM-based Storage Techniques: A Survey
Chen Luo, Michael J. Carey
Recently, the Log-Structured Merge-tree (LSM-tree) has been widely adopted for use in the storage layer of modern NoSQL systems. Because of this, there have been a large number of…