Self-Tuning for Short-Term Memory Consumers
dc.contributor.author | Overbeck, Ludger C. | |
dc.contributor.author | Schmidt, Karsten | |
dc.date.accessioned | 2018-01-10T13:17:53Z | |
dc.date.available | 2018-01-10T13:17:53Z | |
dc.date.issued | 2011 | |
dc.description.abstract | We present an approach to adequately consider short-term memory consumers when using self-tuning buffer techniques. For instance, sort operations often need (large) amounts of memory but only for a short time. Moreover, certain operators, e.g., joins, require (lots of) memory to produce results that are retrieved only once. Unfortunately, most traditional self-tuning techniques fail to observe those peaks, as they need to monitor a system for a while before tuning it, which is often too late. | |
dc.identifier.pissn | 1610-1995 | |
dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/11606 | |
dc.publisher | Springer | |
dc.relation.ispartof | Datenbank-Spektrum: Vol. 11, No. 1 | |
dc.relation.ispartofseries | Datenbank-Spektrum | |
dc.subject | Buffer | |
dc.subject | I/O reduction | |
dc.subject | Memory allocation | |
dc.subject | Self-tuning | |
dc.subject | Short-term memory consumer | |
dc.subject | Sort | |
dc.title | Self-Tuning for Short-Term Memory Consumers | |
dc.type | Text/Journal Article | |
gi.citation.endPage | 41 | |
gi.citation.startPage | 37 |