A Cost-Aware Strategy for Merging Differential Stores in Column-Oriented In-Memory DBMS

@inproceedings{Hbner2011ACS,
  title={A Cost-Aware Strategy for Merging Differential Stores in Column-Oriented In-Memory DBMS},
  author={Florian H{\"u}bner and Joos-Hendrik B{\"o}se and Jens Kr{\"u}ger and Cafer Tosun and Alexander Zeier and Hasso Plattner},
  booktitle={BIRTE},
  year={2011}
}
  • Florian Hübner, Joos-Hendrik Böse, +3 authors Hasso Plattner
  • Published in BIRTE 2011
  • Computer Science
  • Fast execution of analytical and transactional queries in column-oriented in-memory DBMS is achieved by combining a read-optimized data store with a write-optimized differential store. To maintain high read performance, both structures must be merged from time to time. In this paper we describe a new merge algorithm that applies full and partial merge operations based on their costs and improvement of read performance. We show by simulation that our algorithm reduces merge costs significantly… CONTINUE READING
    AND FUTURE DIRECTIONS
    2
    In-Memory Data and Process Management
    DAC: Database Application Context Analysis applied to Enterprise Applications
    1
    Sparse Dictionaries for In-Memory Column Stores
    1

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES
    Fast Updates on Read-Optimized Databases Using Multi-Core CPUs
    125
    C-Store: A Column-oriented DBMS
    1113
    MonetDB/X100: Hyper-Pipelining Query Execution
    525
    In-Memory Data Management -An inflection point, volume 1
    • 2011