Affiliation:
1. École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
2. Chinese Academy of Sciences, Haidian District Beijing, China
3. Intel Labs, Pittsburgh, PA
Abstract
Data warehouses have been traditionally optimized for read-only query performance, allowing only offline updates at night, essentially trading off data freshness for performance. The need for 24x7 operations in global markets and the rise of online and other quickly reacting businesses make concurrent online updates increasingly desirable. Unfortunately, state-of-the-art approaches fall short of supporting fast analysis queries over fresh data. The conventional approach of performing updates in place can dramatically slow down query performance, while prior proposals using differential updates either require large in-memory buffers or may incur significant update migration cost.
This article presents a novel approach for supporting online updates in data warehouses that overcomes the limitations of prior approaches by making judicious use of available SSDs to cache incoming updates. We model the problem of query processing with differential updates as a type of outer join between the data residing on disks and the updates residing on SSDs. We present
MaSM
algorithms for performing such joins and periodic migrations, with small memory footprints, low query overhead, low SSD writes, efficient in-place migration of updates, and correct ACID support. We present detailed modeling of the proposed approach, and provide proofs regarding the fundamental properties of the
MaSM
algorithms. Our experimentation shows that MaSM incurs only up to 7% overhead both on synthetic range scans (varying range size from 4KB to 100GB) and in a TPC-H query replay study, while also increasing the update throughput by orders of magnitude.
Funder
Intel Science & Technology Center for Cloud Computing
CAS Hundred Talents program and by NSFC Innovation Research Group no. 61221062
ESF EurYI award (FN 511.261)
NSF funds
EU-funded FP7 project
Publisher
Association for Computing Machinery (ACM)
Reference60 articles.
1. Lazy-Adaptive Tree
2. BF-tree
3. Flash in a DBMS: Where and how? IEEE Data;Athanassoulis Manos;Engin. Bull.,2010
4. MaSM
5. Warehouse-scale Computing
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献