54 citations · 56 across the 5 of their papers we have counts for
5 papers · 1 filter
O^3-LSM: Maximizing Disaggregated LSM Write Performance via Three-Layer Offloading
Qi Lin, Gangqi Huang, Te Guo +5
Log-Structured Merge-tree-based Key-Value Stores (LSM-KVS) have been optimized and redesigned for disaggregated storage via techniques such as compaction offloading to reduce the n…
Multi-Relational Algebra for Multi-Granular Data Analytics
Xi Wu, Eugene Wu, Zichen Zhu +2
In modern data analytics, analysts frequently face the challenge of searching for desirable entities by evaluating, for each entity, a collection of its feature relations to derive…
NOCAP: Near-Optimal Correlation-Aware Partitioning Joins
Zichen Zhu, Xiao Hu, Manos Athanassoulis
Storage-based joins are still commonly used today because the memory budget does not always scale with the data size. One of the many join algorithms developed that has been widely…
Constructing and Analyzing the LSM Compaction Design Space (Updated Version)
Subhadeep Sarkar, Dimitris Staratzis, Zichen Zhu +1
Log-structured merge (LSM) trees offer efficient ingestion by appending incoming data, and thus, are widely used as the storage layer of production NoSQL data stores. To enable com…
Learning Key-Value Store Design
Stratos Idreos, Niv Dayan, Wilson Qin +8
We introduce the concept of design continuums for the data layout of key-value stores. A design continuum unifies major distinct data structure designs under the same model. The cr…