Optimal splitters for temporal and multi-version databases

  • Authors:

  • Wangchao Le;Feifei Li;Yufei Tao;Robert Christensen

  • Affiliations:

  • School of Computing, University of Utah, Salt Lake City, UT, USA;School of Computing, University of Utah, Salt Lake City, UT, USA;Chinese University of Hong Kong/ Korea Advanced Institute of Science and Technology, Hong Kong, China;School of Computing, University of Utah, Salt Lake City, UT, USA

  • Venue:
  • Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 (commodity) 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. We 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. We design efficient methods for memory- and disk resident data respectively, and show that they significantly outperform competing baseline methods both theoretically and empirically on large real data sets.