Dynamic Workload-Based Partitioning for Large-Scale Databases - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Dynamic Workload-Based Partitioning for Large-Scale Databases

(1) , (1) , (1) , (2) , (1)
1
2
Reza Akbarinia
Esther Pacitti
Patrick Valduriez

Abstract

Applications with very large databases, where data items are continuously appended, are becoming more and more common. Thus, the development of efficient workload-based data partitioning is one of the main requirements to offer good performance to most of those applications that have complex access patterns, e.g. scientific applications. However, the existing workload-based approaches, which are executed in a static way, cannot be applied to very large databases. In this paper, we propose DynPart, a dynamic partitioning algorithm for continuously growing databases. DynPart efficiently adapts the data partitioning to the arrival of new data elements by taking into account the affinity of new data with queries and fragments. In contrast to existing static approaches, our approach offers a constant execution time, no matter the size of the database, while obtaining very good partitioning efficiency. We validated our solution through experimentation over real-world data; the results show its effectiveness.
Fichier principal
Vignette du fichier
dexa_2012.pdf (138.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00748549 , version 1 (05-11-2012)

Identifiers

Cite

Miguel Liroz-Gistau, Reza Akbarinia, Esther Pacitti, Fabio Porto, Patrick Valduriez. Dynamic Workload-Based Partitioning for Large-Scale Databases. DEXA: Database and Expert Systems Applications, Sep 2012, Vienna, Austria. pp.183-190, ⟨10.1007/978-3-642-32597-7_16⟩. ⟨lirmm-00748549⟩
218 View
632 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More