{"title":"Database partitioning techniques to support reload in a main memory database system: MARS","authors":"L. Gruenwald, M. Eich","doi":"10.1109/PARBSE.1990.77125","DOIUrl":null,"url":null,"abstract":"The authors examine the effect of different partitioning techniques on the MMDB (main memory database) reload problem in terms of the number of I/Os for reload and number of MM references during transaction processing. The best technique is the one that yields the minimum overall cost with regard to both properties. It is shown that horizontal and single vertical partitioning are actually the only possible candidates. Physical vertical never yields the best result. In some very rare cases, group vertical outperforms the other techniques. If the database system encountered performs more selections than projections and joins, and more tuple modifications or tuple deletions than tuple insertions, then horizontal is the best technique. Otherwise, single vertical is the chosen technique. It is also shown that, if reload is the only concern, that is, if the transaction performance is not taken into account, then single vertical is always the best choice.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PARBSE.1990.77125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The authors examine the effect of different partitioning techniques on the MMDB (main memory database) reload problem in terms of the number of I/Os for reload and number of MM references during transaction processing. The best technique is the one that yields the minimum overall cost with regard to both properties. It is shown that horizontal and single vertical partitioning are actually the only possible candidates. Physical vertical never yields the best result. In some very rare cases, group vertical outperforms the other techniques. If the database system encountered performs more selections than projections and joins, and more tuple modifications or tuple deletions than tuple insertions, then horizontal is the best technique. Otherwise, single vertical is the chosen technique. It is also shown that, if reload is the only concern, that is, if the transaction performance is not taken into account, then single vertical is always the best choice.<>