{"title":"Towards Optimal Snapshot Materialization to Support Large Query Workload for Append-Only Temporal Databases","authors":"Amin Beiraimi, K. Pu, Ying Zhu","doi":"10.1109/BigDataCongress.2018.00048","DOIUrl":null,"url":null,"abstract":"We present several results on optimal snapshot materialization for append-only temporal databases in order to support very large scale query workload. Our data model is temporal relational data stored in an append-only database. When the temporal database receives multiple queries querying at different timestamps along the timeline, it would be prohibitively expensive to recompute the snapshots at each of the timestamps. In this paper, we present a practical solution to support large query load by materializing m snapshots at optimal timestamps. We show that optimal snapshot timestamps can be computed efficiently in linear time. We further show that with varying query load, we can dynamically adjust snapshots to adjust to the changin query load.","PeriodicalId":177250,"journal":{"name":"2018 IEEE International Congress on Big Data (BigData Congress)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Congress on Big Data (BigData Congress)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BigDataCongress.2018.00048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We present several results on optimal snapshot materialization for append-only temporal databases in order to support very large scale query workload. Our data model is temporal relational data stored in an append-only database. When the temporal database receives multiple queries querying at different timestamps along the timeline, it would be prohibitively expensive to recompute the snapshots at each of the timestamps. In this paper, we present a practical solution to support large query load by materializing m snapshots at optimal timestamps. We show that optimal snapshot timestamps can be computed efficiently in linear time. We further show that with varying query load, we can dynamically adjust snapshots to adjust to the changin query load.