Optimal Splitters for Temporal and Multi-Version Databases

Provided by: Association for Computing Machinery
Topic: Storage
Format: PDF
Temporal and multi-version databases are ideal candidates for a distributed store, which offers large storage space, and parallel and distributed processing power from a cluster of machines. A key challenge is to achieve a good load balancing algorithm for storage and processing of these data, which is done by partitioning the database. The authors introduce the concept of optimal splitters for temporal and multi-version databases, which induce a partition of the input data set, and guarantee that the size of the maximum bucket be minimized among all possible configurations, given a budget for the desired number of buckets.

Find By Topic