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.
Similar content being viewed by others
References
Bächle S, Schmidt K (2011) Lightweight performance forecasts for buffer algorithms. In: Proc BTW, LNI, vol P-180. To appear
Graefe G (1993) Query evaluation techniques for large databases. ACM Comput Surv 25(2):73–169. http://doi.acm.org/10.1145/152610.152611
Haustein MP, Härder T (2007) An efficient infrastructure for native transactional XML processing. DATAK 61(3):500–523
Storm AJ, Garcia-arellano C (2006) Adaptive self-tuning memory in DB2. In: Proc of the 2006 intl conf on very large data bases
TU Kaiserslautern, AG DBIS: The XTC project: native XML data management. Website (2010). Available online at http://xtc-project.de visited on February 2nd 2011
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Overbeck, L.C., Schmidt, K. Self-Tuning for Short-Term Memory Consumers. Datenbank Spektrum 11, 37–41 (2011). https://doi.org/10.1007/s13222-011-0048-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13222-011-0048-4