The database architecture discussed so far was optimized for read operations. In the previously described approach an insert of a single tuple can force a restructuring of the whole table if a new attribute value occurs and the dictionary has to be resorted. To overcome this problem, we will introduce the differential buffer in this chapter.
- [HBK+11]F. Hübner, J.-H. Böse, J. Krüger, C. Tosun, A. Zeier, H. Plattner, A cost-aware strategy for merging differential stores in column-oriented in-memory DBMS, in BIRTE, pp. 38–52, 2011Google Scholar
- [RR00]J. Rao, K.A. Ross, Making B+-trees cache conscious in main memory, in Proceedings of the 2000 ACM SIGMOD international conference on Management of data, SIGMOD ’00 (ACM, New York, 2000), pp. 475–486Google Scholar