- AutorIn
- Dr.-Ing. Tim Kiefer Technische Universität Dresden, Fakultät Informatik, Institut für Systemarchitektur, Professur für Datenbanken
- Prof. Dr.-Ing. habil. Dirk HabichTechnische Universität Dresden, Fakultät Informatik, Institut für Systemarchitektur, Professur für Datenbanken
- Prof. Dr.-Ing. Wolfgang LehnerTechnische Universität Dresden, Fakultät für Informatik, Institut für Systemarchitektur, Professur für Datenbanken
- Titel
- Penalized Graph Partitioning based Allocation Strategy for Database-as-a-Service Systems
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-806441
- Konferenz
- UCC '16: 9th International Conference on Utility and Cloud Computing. Shangai, 6. - 9. Dezember 2016
- Quellenangabe
- BDCAT '16: Proceedings of the 3rd IEEE/ACM International Conference on Big Data Computing, Applications and Technologies
Herausgeber: Ashiq Anjum
Herausgeber: Xinghui Zhao
Erscheinungsort: New York
Verlag: ACM
Erscheinungsjahr: 2016
Seiten: 200-209
ISBN: 978-1-4503-4617-7 - Erstveröffentlichung
- 2016
- Abstract (EN)
- Databases as a service (DBaaS) transfer the advantages of cloud computing to data management systems, which is important for the big data era. The allocation in a DBaaS system, i.e., the mapping from databases to nodes of the infrastructure, influences performance, utilization, and cost-effectiveness of the system. Modeling databases and the underlying infrastructure as weighted graphs and using graph partitioning and mapping algorithms yields an allocation strategy. However, graph partitioning assumes that individual vertex weights add up (linearly) to partition weights. In reality, performance does usually not scale linearly with the amount of work due to contention on the hardware, on operating system resources, or on DBMS components. To overcome this issue, we propose an allocation strategy based on penalized graph partitioning in this paper. We show how existing algorithms can be modified for graphs with non-linear partition weights, i.e., vertex weights that do not sum up linearly to partition weights. We experimentally evaluate our allocation strategy in a DBaaS system with 1,000 databases on 32 nodes.
- Andere Ausgabe
- Link zum Artikel, der zuerst in der ACM Digital Library erschienen ist
DOI: 10.1145/3006299.3006300 - Freie Schlagwörter (DE)
- Lastausgleich, Datenbank-as-a-Service, Abfrageverarbeitung, Zuteilung
- Freie Schlagwörter (EN)
- Load Balancing, Database-as-a-Service, Query Processing, Allocation
- Klassifikation (DDC)
- 004
- Verlag
- ACM, New York
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-806441
- Veröffentlichungsdatum Qucosa
- 16.09.2022
- Dokumenttyp
- Konferenzbeitrag
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis