Robust and efficient memory management in Apache AsterixDB-Reference-Cited by-同舟云学术

Robust and efficient memory management in Apache AsterixDB

Published:2020-02-17 Issue:7 Volume:50 Page:1114-1151
ISSN:0038-0644
Container-title:Software: Practice and Experience
language:en
Short-container-title:Softw: Pract Exper

Author:

Kim Taewoo¹^ORCID,Behm Alexander²,Blow Michael³,Borkar Vinayak²,Bu Yingyi²,Carey Michael J.¹,Hubail Murtadha²³,Jahangiri Shiva¹,Jia Jianfeng²,Li Chen¹,Luo Chen¹,Maxon Ian¹,Pirzadeh Pouria²

Affiliation:

1. Department of Computer ScienceUniversity of California at Irvine Irvine California

2. University of California at Irvine Irvine California

3. Couchbase Santa Clara California

Funder

Facebook

Google

Microsoft

National Science Foundation

Publisher

Wiley

Subject

Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/spe.2799

Reference34 articles.

1. GrayJ PutzoluF. The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for cpu time. Paper presented at: Proceedings of the 1987 ACM SIGMOD; 1987:395‐398; San Francisco CA.

2. The five-minute rule ten years later, and other computer storage rules of thumb

3. GraefeG. The five‐minute rule twenty years later and how flash memory changes the rules. Paper presented at: Proceedings of the 3rd International Workshop on Data Management on New Hardware DaMoN '07; 2007:6:1‐6:9; Beijing China.

4. AppuswamyR Borovica‐GajicR GraefeG AilamakiA. The five‐minute rule thirty years later and its impact on the storage hierarchy. Paper presented at: Proceedings of the 7th International Workshop on Accelerating Analytics and Data Management Systems Using Modern Processor and Storage Architectures; 2017:1‐8.

5. XuQ SiyamwalaH GhoshM et al. Performance analysis of NVMe SSDs and their implication on real world databases. Paper presented at: Proceedings of the 8th ACM International Systems and Storage Conference; 2015:6:1‐6:11.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Can Modern LLMs Tune and Configure LSM-based Key-Value Stores?;Proceedings of the 16th ACM Workshop on Hot Topics in Storage and File Systems;2024-07-08

2. Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in a Colossal Configuration Space;Proceedings of the ACM on Management of Data;2024-05-29

3. Towards flexibility and robustness of LSM trees;The VLDB Journal;2024-01-11

4. NOCAP: Near-Optimal Correlation-Aware Partitioning Joins;Proceedings of the ACM on Management of Data;2023-12-08

5. Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads;Proceedings of the ACM on Management of Data;2023-11-13