Lightweight data compression is frequently applied in main memory database systems to improve query performance. The data processed by such systems is highly diverse. Moreover, there is a high number of existing lightweight compression techniques. Therefore, choosing the optimal technique for a given dataset is non-trivial. Existing approaches are based on simple rules, which do not suffice for such a complex decision. In contrast, our vision is a cost-based approach. However, this requires a detailed cost model, which can only be obtained from a systematic benchmarking of many compression algorithms on many different datasets. A naïve benchmark evaluates every algorithm under consideration separately. This yields many redundant steps and is thus inefficient. We propose an efficient and extensible benchmark framework for compression techniques. Given an ensemble of algorithms, it minimizes the overall run time of the evaluation. We experimentally show that our approach outperforms the naïve approach.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:83309 |
| Date | 03 February 2023 |
| Creators | Damme, Patrick, Habich, Dirk, Lehner, Wolfgang |
| Publisher | Springer |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/acceptedVersion, doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 978-3-319-31408-2, 978-3-319-31409-9, 10.1007/978-3-319-31409-9_6, info:eu-repo/grantAgreement/Deutsche Forschungsgemeinschaft/Sachbeihilfen/255187874//Leichtgewichtige Kompressionsverfahren zur Optimierung komplexer Datenbankanfragen/LE-1416/26-1 |
Page generated in 0.0025 seconds