Paper Info
Title
Towards Dynamic Data Placement For Polystore Ingestion
Abstract
Integrating low-latency data streaming into data warehouse architectures has become an important enhancement to support modern data warehousing applications. In these architectures, heterogeneous workloads with data ingestion and analytical queries must be executed with strict performance guarantees. Furthermore, the data warehouse may consists of multiple different types of storage engines (a.k.a., polystores or multi-stores). A paramount problem is data placement; different workload scenarios call for different data placement designs. Moreover, workload conditions change frequently. In this paper, we provide evidence that a dynamic, workload-driven approach is needed for data placement in polystores with low-latency data ingestion support. We study the problem based on the characteristics of the TPC-DI benchmark in the context of an abbreviated polystore that consists of S-Store and Postgres.
Year
DOI
Venue
2017
10.1145/3129292.3129297
PROCEEDINGS OF THE ELEVENTH INTERNATIONAL WORKSHOP ON REAL-TIME BUSINESS INTELLIGENCE AND ANALYTICS
Field
DocType
Citations 
Data warehouse,Data mining,Workload,Computer data storage,Computer science,Dynamic data,Database
Conference
0
PageRank 
References 
Authors
0.34
16
4
Name
Order
Citations
PageRank
Jiang Du1332.43
John Meehan2694.27
Nesime Tatbul33415239.74
Stanley B. Zdonik491861660.15