Improving Admission Control Policies in Database Management Systems, Using Data Mining Techniques

Increasing workload on multi-user database management system (DBMS) can cause maximum system's throughput. With further increase of workload, throughput dramatically decreases and system performance fall down; then system starts to thrash. Existence of an admission control component for managing user's requests is necessary. Admission control component in DBMS has two main tasks. These tasks are Prevention of increasing user's communication requests to system more than a threshold and prevention, deferment or execution of received requests after optimization step and determination of request requirements. The problem is determination of allowable number of communications to DBMS. Can we predict and determine conditions to providence time and resource before reach to optimization step? In this paper we use data mining techniques to predict and describe admission control policies. According to this purpose we recommend an Admission Logging system to log existing actions before end of query processor procedures. We describe situation, structure, and changes that we need in system. Then we describe the circumstance of knowledge extraction on Admission Log.

[1]  Volker Markl,et al.  LEO - DB2's LEarning Optimizer , 2001, VLDB.

[2]  Miron Livny,et al.  Priority-Hints: An Algorithm for Priority-Based Buffer Management , 1990, VLDB.

[3]  Ulrich Güntzer,et al.  Algorithms for association rule mining — a general survey and comparison , 2000, SKDD.

[4]  Jayant R. Haritsa,et al.  Plan Selection Based on Query Clustering , 2002, VLDB.

[5]  Miron Livny,et al.  Concurrency control performance modeling: alternatives and implications , 1987, TODS.

[6]  Jiawei Han.  Data mining techniques , 1996, SIGMOD '96.

[7]  M. Howard Williams,et al.  Analytical response time estimation in parallel relational database systems , 2004, Parallel Comput..

[8]  Patrick Martin,et al.  Workload adaptation in autonomic DBMSs , 2006, CASCON.

[9]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[10]  Chetan Gupta,et al.  Automatic Workload Management for Enterprise Data Warehouses , 2008, IEEE Data Eng. Bull..

[11]  Philip S. Yu,et al.  Data Mining: An Overview from a Database Perspective , 1996, IEEE Trans. Knowl. Data Eng..

[12]  Volker Markl,et al.  LEO: An autonomic query optimizer for DB2 , 2003, IBM Syst. J..

[13]  Azer Bestavros,et al.  Value-cognizant admission control for RTDB systems , 1996, 17th IEEE Real-Time Systems Symposium.

[14]  Pavel Berkhin,et al.  A Survey of Clustering Data Mining Techniques , 2006, Grouping Multidimensional Data.

[15]  Rakesh Agrawal,et al.  SPRINT: A Scalable Parallel Classifier for Data Mining , 1996, VLDB.

[16]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.

[17]  Geoff Huston,et al.  Quality of Service: Delivering QoS on the Internet and in Corporate Networks , 1998 .

[18]  Tomasz Imielinski,et al.  An Interval Classifier for Database Mining Applications , 1992, VLDB.

[19]  Chetan Gupta,et al.  rFEED: A Mixed Workload Scheduler for Enterprise Data Warehouses , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[20]  Hiroshi Saito,et al.  Teletraffic Technologies in ATM Networks , 1994 .

[21]  Said Elnaffar,et al.  Today's DBMSs: how autonomic are they , 2003, 14th International Workshop on Database and Expert Systems Applications, 2003. Proceedings..

[22]  Mor Harchol-Balter,et al.  Priority mechanisms for OLTP and transactional Web applications , 2004, Proceedings. 20th International Conference on Data Engineering.

[23]  Azer Bestavros,et al.  An Admission Control Paradigm for Real-Time Databases , 1996 .

[24]  Miron Livny,et al.  Priority in DBMS Resource Scheduling , 1989, VLDB.

[25]  Kimmo E. E. Raatikainen,et al.  Cluster analysis and workload classification , 1993, PERV.