Optimizing An In-memory Database System For AI-powered On-line Decision Augmentation Using Persistent Memory
Cheng Chen, Jun Yang, Mian Lu, Taize Wang, Zhao Zheng, Yuqiang Chen, Wenyuan Dai, Bingsheng He, Weng-Fai Wong, Guoan Wu, Yuping Zhao, Andy Rudoff
Abstract
On-line decision augmentation (OLDA) has been considered as a promising paradigm for real-time decision making powered by Artificial Intelligence (AI). OLDA has been widely used in many applications such as real-time fraud detection, personalized recommendation, etc. On-line inference puts real-time features extracted from multiple time windows through a pre-trained model to evaluate new data to support decision making. Feature extraction is usually the most time-consuming operation in many OLDA data pipelines. In this work, we started by studying how existing in-memory databases can be leveraged to efficiently support such real-time feature extractions. However, we found that existing in-memory databases cost hundreds or even thousands of milliseconds. This is unacceptable for OLDA applications with strict real-time constraints. We therefore propose FEDB ( F eature E ngineering D ata b ase), a distributed in-memory database system designed to efficiently support on-line feature extraction. Our experimental results show that FEDB can be one to two orders of magnitude faster than the state-of-the-art in-memory databases on real-time feature extraction. Furthermore, we explore the use of the Intel Optane DC Persistent Memory Module (PMEM) to make FEDB more cost-effective. When comparing the proposed PMEM-optimized persistent skiplist to the FEDB using DRAM+SSD, PMEM-based FEDB can shorten the tail latency up to 19.7%, reduce the recovery time up to 99.7%, and save up to 58.4% total cost of a real OLDA pipeline.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 2340786b-4a33-467e-b889-bdde08ec1c45Cited by top-tier papers2
- Optimizing Data Pipelines for Machine Learning in Feature StoresRui Liu, Kwanghyun Park, Fotis Psallidas, Xiaoyong Zhu et al.VLDB 2023 · 10 citations
- Biathlon: Harnessing Model Resilience for Accelerating ML Inference PipelinesChaokun Chang, Eric Lo, Chunxiao YeVLDB 2024 · 5 citations
Builds on3
- FlatStore: An Efficient Log-Structured Key-Value Storage Engine for Persistent MemoryYoumin Chen, Youyou Lu, Fan Yang, Qing Wang et al.ASPLOS 2020 · 166 citations
- Deep Learning Models for Selectivity Estimation of Multi-Attribute QueriesShohedul Hasan, Saravanan Thirumuruganathan, Jees Augustine, Nick Koudas et al.SIGMOD 2020 · 101 citations
- Dash: Scalable Hashing on Persistent MemoryBaotong Lu, Xiangpeng Hao, Tianzheng Wang, Eric LoVLDB 2020 · 8 citations
Related papers
- PerMA-Bench: Benchmarking Persistent Memory AccessLawrence Benson, Leon Papke, Tilmann RablVLDB 2022 · 19 citations
- APEX: A High-Performance Learned Index on Persistent MemoryBaotong Lu, Jialin Ding, Eric Lo, Umar Farooq Minhas et al.VLDB 2022 · 73 citations
- Single Machine Graph Analytics on Massive Datasets Using Intel Optane DC Persistent MemoryGurbinder Gill, Roshan Dathathri, Loc Hoang, Ramesh Peri et al.VLDB 2020 · 82 citations
- Maximizing Persistent Memory Bandwidth Utilization for OLAP WorkloadsBjörn Daase, Lars Jonas Bollmeier, Lawrence Benson, Tilmann RablSIGMOD 2021 · 38 citations
- PetPS: Supporting Huge Embedding Models with Persistent MemoryMinhui Xie, Youyou Lu, Qing Wang, Yangyang Feng et al.VLDB 2023 · 10 citations
