Dynamic Workload-Based Partitioning Algorithms for Continuously Growing Databases
Applications with very large databases, where data items are continuously appended, are becoming more and more common. Thus, the development of efficient data partitioning is one of the main requirements to yield good performance. In the case of applications that have complex access patterns, e.g. scientific applications, workload-based partitioning could be exploited. However, existing workload-based approaches, which work in a static way, cannot be applied to very large databases. In this paper, the authors propose DynPart and DynPartGroup, two dynamic partitioning algorithms for continuously growing databases.