activity
20182021
most citedEfficiently Reclaiming Space in a Log Structured Store

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.DBShow all

6 papers · 1 filter

cs.DB2021

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…

cs.DB20201 cited

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…

cs.DB2020

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…

cs.DB2019

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…

cs.DB2018

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…

cs.DB2018

Efficient Data Ingestion and Query Processing for LSM-Based Storage Systems

Chen Luo, Michael J. Carey

In recent years, the Log Structured Merge (LSM) tree has been widely adopted by NoSQL and NewSQL systems for its superior write performance. Despite its popularity, however, most e…