Online Updates on Data Warehouses via Judicious Use of Solid-State Storage

Author:

Athanassoulis Manos1,Chen Shimin2,Ailamaki Anastasia1,Gibbons Philip B.3,Stoica Radu1

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)

Subject

Information Systems

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篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Enabling Timely and Persistent Deletion in LSM-Engines;ACM Transactions on Database Systems;2023-08-09

2. Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines;Foundations and Trends® in Databases;2023

3. Lethe: A Tunable Delete-Aware LSM Engine;Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data;2020-06-11

4. Big Data Velocity Management–From Stream to Warehouse via High Performance Memory Optimized Index Join;IEEE Access;2020

5. Optimal column layout for hybrid workloads;Proceedings of the VLDB Endowment;2019-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3