7 citations · 15 across the 5 of their papers we have counts for
5 papers
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…
Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree
Abdullah Al-Mamun, Ch. Md. Rakin Haider, Jianguo Wang +1
Machine Learning (ML) techniques have been successfully applied to design various learned database index structures for both the one- and multi-dimensional spaces. Particularly, a…
Cache Coherence Over Disaggregated Memory
Ruihong Wang, Jianguo Wang, Walid G. Aref
Disaggregating memory from compute offers the opportunity to better utilize stranded memory in cloud data centers. It is important to cache data in the compute nodes and maintain c…
A Survey of Learned Indexes for the Multi-dimensional Space
Abdullah Al-Mamun, Hao Wu, Qiyang He +2
A recent research trend involves treating database index structures as Machine Learning (ML) models. In this domain, single or multiple ML models are trained to learn the mapping f…
An Experimental Evaluation and Investigation of Waves of Misery in R-trees
Lu Xing, Eric Lee, Tong An +5
Waves of misery is a phenomenon where spikes of many node splits occur over short periods of time in tree indexes. Waves of misery negatively affect the performance of tree indexes…