Workload-Driven Fragment Allocation for Partially Replicated Databases Using Linear Programming
- In replication schemes, replica nodes can process read-only queries on snapshots of the master node without violating transactional consistency. By analyzing the workload, we can identify query access patterns and replicate data depending to its access frequency. In this paper, we define a linear programming (LP) model to calculate the set of partial replicas with the lowest overall memory capacity while evenly balancing the query load. Furthermore, we propose a scalable decomposition heuristic to calculate solutions for larger problem sizes. While guaranteeing the same performance as state-of-the-art heuristics, our decomposition approach calculates allocations with up to 23% lower memory footprint for the TPC-H benchmark.
| Author details: | Stefan Halfpap, Rainer SchlosserORCiDGND |
|---|---|
| DOI: | https://doi.org/10.1109/ICDE.2019.00188 |
| ISBN: | 978-1-5386-7474-1 |
| ISBN: | 978-1-5386-7475-8 |
| ISSN: | 1084-4627 |
| ISSN: | 2375-026X |
| ISSN: | 1063-6382 |
| Title of parent work (English): | 2019 IEEE 35th International Conference on Data Engineering (ICDE) |
| Publisher: | IEEE |
| Place of publishing: | New York |
| Publication type: | Other |
| Language: | English |
| Year of first publication: | 2019 |
| Publication year: | 2019 |
| Release date: | 2021/05/05 |
| Tag: | allocation problem; database replication; linear programming |
| Number of pages: | 4 |
| First page: | 1746 |
| Last Page: | 1749 |
| Organizational units: | Digital Engineering Fakultät / Hasso-Plattner-Institut für Digital Engineering GmbH |
| DDC classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 000 Informatik, Informationswissenschaft, allgemeine Werke |
| Peer review: | Referiert |
