University of Osnabrueck
Cache of a persistent data structure represents an important part, which significantly influence its efficiency. Cache consists from an array of main memory blocks (called cache nodes) with a constant size. Cache nodes buffer the data structure nodes hence they can be accessed quickly. However, data structure nodes do not usually fully utilize the whole main memory block. Therefore, the constant cache node sizes the waste of the main memory. In this paper, the authors propose the solution where the cache consists from the cache nodes with a different size.