Weight-Based Query Optimization System Using Buffer
Fast retrieval of data has been a need of user in any
database application. This paper introduces a buffer based query
optimization technique in which queries are assigned weights
according to their number of execution in a query bank. These
queries and their optimized executed plans are loaded into the buffer
at the start of the database application. For every query the system
searches for a match in the buffer and executes the plan without
creating new plans.
[1] K. Shim, T. Sellis and D. Nau, Improvements on a heuristic algorithm
for multiple-query optimization, Data and Knowledge Engineering, 12,
1994.
[2] Yannis E. Ioannidis, Query Optimization. ACM Computer Surv. 28(1):
121-123 (1996).
[3] Georgia Kouttrika and Yannis Ionnidis, Ruled-based query
personalization in digital libraries, International journal digital library, 4:
60-63 (2004).
[4] Hristidis V, Koudas N, Papakonstantinou Y, Prefer: a system for the
efficient execution of multiparametric ranked. Proceedings of the ACM
SIGMOD international conference on management of data, Santa
Barbara, CA, 21-24 May 2001. pp 259-270.
[1] K. Shim, T. Sellis and D. Nau, Improvements on a heuristic algorithm
for multiple-query optimization, Data and Knowledge Engineering, 12,
1994.
[2] Yannis E. Ioannidis, Query Optimization. ACM Computer Surv. 28(1):
121-123 (1996).
[3] Georgia Kouttrika and Yannis Ionnidis, Ruled-based query
personalization in digital libraries, International journal digital library, 4:
60-63 (2004).
[4] Hristidis V, Koudas N, Papakonstantinou Y, Prefer: a system for the
efficient execution of multiparametric ranked. Proceedings of the ACM
SIGMOD international conference on management of data, Santa
Barbara, CA, 21-24 May 2001. pp 259-270.
@article{"International Journal of Information, Control and Computer Sciences:55103", author = "Kashif Irfan and Fahad Shahbaz Khan and Tehseen Zia and M. A. Anwar", title = "Weight-Based Query Optimization System Using Buffer", abstract = "Fast retrieval of data has been a need of user in any
database application. This paper introduces a buffer based query
optimization technique in which queries are assigned weights
according to their number of execution in a query bank. These
queries and their optimized executed plans are loaded into the buffer
at the start of the database application. For every query the system
searches for a match in the buffer and executes the plan without
creating new plans.", keywords = "Query Bank, Query Matcher, Weight Manager.", volume = "2", number = "1", pages = "103-3", }