Database Tuning Using Trade-Off Elimination
Database systems need to be prepared to cope with trade-offs arising from different kinds of workloads that different deployments of the same system need to support. To this end, systems offer tuning parameters that allow experienced system administrators to tune the system to the workload characteristics of the application(s) at hand. As part of the self-management capabilities of a database system, it is desirable to eliminate these tuning parameters and rather provide an algorithm for parameter settings such that near-optimal performance is achieved across a very wide range of workload properties. This is the trade-off elimination paradigm. The nature of the solution for trade-off elimination depends on specific tuning problems; its principal feasibility has been successfully demonstrated on issues such as file striping and cache management.
To cope with applications that exhibit a wide variety of workload characteristics, database systems have...
- 1.Cao P, Irani S. Cost-aware WWW proxy caching algorithms. In: Proceedings of the 1st USENIX Symposium on Internet Technologies and Systems; 1997.Google Scholar
- 3.Coffman Jr EG, Denning PJ. Operating systems theory. Englewood Cliffs: Prentice-Hall; 1973.Google Scholar
- 5.Johnson T, Shasha D. 2Q: a low overhead high performance buffer management replacement algorithm. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 439–50.Google Scholar
- 8.O’Neil EJ, O’Neil PE, Weikum G. The LRU-K page replacement algorithm for database disk buffering. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1993. p. 297–306.Google Scholar