Preview

tcr an algorithm for replacinng the cache memory for use indatabase

Powerful Essays
Open Document
Open Document
1564 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
tcr an algorithm for replacinng the cache memory for use indatabase
Temporal Cache Replacement Algorithm for
Database Tuning
Anju James, Nimishamol C.T. and Sheena V. M.
Don Bosco College
Kannur, India.
March 24, 2013
Abstract
Query optimization is an important area in database management system, especially when the database is large. Researchers have proposed several query optimization techniques for large databases. Automated physical design tuning for database systems is one of them. Most of the tools for automated tuning depend on repeated optimizing queries. Such approaches are computationally expensive. Hence the running time becomes unacceptably long. It is estimated that over 90% of the tuning session is spent on query optimization [6]. Running time is less, when heuristic searching techniques are applied. However, this introduces inaccuracy in the search result, causing the selection of sub-optimal results.
In this paper, we propose a new cache replacement algorithm to optimize the search queries. It is based on the time taken for the database query.

1

Introduction

A database is a collection of related data. A database management system
(DBMS) is a suit of computer software providing the interface between a user and database(s). The performance of a database system depends crucially on its physical design. An effective physical design must match the traits of the workload. It is mandatory that within the constraints of a budget, we need to identify a configuration, that results in optimal cost for a given workload.
Applications of DBMS are on the increase. Most complex applications require support of large database. This indicates the need to optimize database query. Tuning of physical design of the database is one way of achieving this aim. The physical design tuning problem can be formally defined as given a query workload W and a storage budget B, the task is to find the set of physical structures, or configuration that fits in B and results in the lowest execution cost for W [2].
Many



References: [1] Ionnis Alagiannis. Towards adaptive, flexible, and self-tuned database. In EDIC Research Proposal, 2010. Data Eng. Bull, pages 19–29, 1995. [6] N.Bruno and S.Choudhari. Automatic physical database tuning: A relaxation based approach. In SIGMOD conference, 2005.

You May Also Find These Documents Helpful