Workload-Driven Data Placement for Tierless In-Memory Database Systems
| dc.contributor.author | Hurdelhey, Ben | |
| dc.contributor.author | Weisgut, Marcel | |
| dc.contributor.author | Boissier, Martin | |
| dc.contributor.editor | König-Ries, Birgitta | |
| dc.contributor.editor | Scherzinger, Stefanie | |
| dc.contributor.editor | Lehner, Wolfgang | |
| dc.contributor.editor | Vossen, Gottfried | |
| dc.date.accessioned | 2023-02-23T13:59:49Z | |
| dc.date.available | 2023-02-23T13:59:49Z | |
| dc.date.issued | 2023 | |
| dc.description.abstract | High main memory consumption is a significant cost factor for in-memory database systems. Tiering, i.e., placing parts of the data on memory or storage devices other than DRAM, reduces the main memory footprint. A controlled data placement can assign rarely accessed data to slow devices while frequently used data remains on fast devices, such as main memory, to maintain acceptable query latencies. We present an automatic data placement decision system for the in-memory database Hyrise. The system organizes the memory and storage devices in a tierless pool, with no fixed device class categorization or performance order. The system supports data placement use cases, such as minimizing end-to-end query latencies and making cost-optimal purchase recommendations in cloud environments. In this paper, we introduce an efficient calibration process to derive cost models for various storage devices. To determine data placements, we introduce a linear programming-based approach, which yields optimal configurations, and an efficient heuristic. With a set of main memory and SSD devices, we can reduce the main memory consumption for base table data of the TPC-DS benchmark by 74 percent when accepting a workload latency increase of 52 percent. In a comparison of data placement algorithms and cost models, we find that simplistic algorithms (e.g., greedy algorithms) can present viable alternatives to optimal linear programming algorithms, especially under cost prediction inaccuracies. | en |
| dc.identifier.doi | 10.18420/BTW2023-02 | |
| dc.identifier.isbn | 978-3-88579-725-8 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/40324 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | BTW 2023 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-331 | |
| dc.subject | Tiering | |
| dc.subject | Data Placement | |
| dc.subject | In-Memory Database Systems | |
| dc.subject | Linear Programming | |
| dc.subject | Cost Models | |
| dc.title | Workload-Driven Data Placement for Tierless In-Memory Database Systems | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 70 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 47 | |
| gi.conference.date | 06.-10. März 2023 | |
| gi.conference.location | Dresden, Germany |
Dateien
Originalbündel
1 - 1 von 1
Vorschaubild nicht verfügbar
- Name:
- B1-2.pdf
- Größe:
- 804.4 KB
- Format:
- Adobe Portable Document Format