Optimal splitters for temporal and multi-version databases
Refereed conference paper presented and published in conference proceedings

Times Cited
Altmetrics Information

Other information
AbstractTemporal 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. Copyright © 2013 ACM.
All Author(s) ListLe W., Li F., Tao Y., Christensen R.
Name of Conference2013 ACM SIGMOD Conference on Management of Data, SIGMOD 2013
Start Date of Conference22/06/2013
End Date of Conference27/06/2013
Place of ConferenceNew York, NY
Country/Region of ConferenceUnited States of America
Detailed descriptionorganized by ACM,
Pages109 - 120
LanguagesEnglish-United Kingdom
KeywordsMulti-version databases, Optimal splitters, Temporal data

Last updated on 2020-25-10 at 00:41