Query Optimization Approach in SQL to prepare Data Sets for Data Mining Analysis
 | International Journal of Computer Trends and Technology (IJCTT) |  |
| © - August Issue 2013 by IJCTT Journal | ||
| Volume-4 Issue-8 | ||
| Year of Publication : 2013 | ||
| Authors :Rajesh Reddy Muley, Sravani Achanta, Prof.S.V.Achutha Rao |
Rajesh Reddy Muley, Sravani Achanta, Prof.S.V.Achutha Rao"Query Optimization Approach in SQL to prepare Data Sets for Data Mining Analysis"International Journal of Computer Trends and Technology (IJCTT),V4(8):2800-2804 August Issue 2013 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.
Abstract:- Collecting the information from various databases and presenting it to the user is a tough job and presenting the data as per the user requirement is even more tough because the user may need the data to be shown in many different ways. Moreover the data that has to be shown to the may not be present in one single database but may be present in more than one database tables. In normal way if the user is trying to access the details with very few requirements which are in a single table then there is no problem but if the data to be shown to user is present in many tables then the issue is to merge that data by using many queries for retrieval and then arrange as in the way expected by user. To overcome this drawback of presenting the data in much easier way and also reduce the overload on database we have data mining methods to solve the problem. This paper explains us the way to use the data mining methods to show the datasets by mining the data from different tables at the same time. The methods which are suitable for data mining analysis are CASE, SPJ and PIVOT. Coming with CASE we show two possibilities i.e. Vertical view and also the Horizontal View. This paper thus satisfies the main concern i.e. reducing the overload on the databases for retrieval of data.
References-
[1] G. Bhargava, P. Goel, and B.R. Iyer. Hypergraph based reordering of outer join queries with complex predicates. In ACM SIGMOD Conference, pages 304.315, 1995.
[2]J.A. Blakeley, V. Rao, I. Kunen, A. Prout, M. Henaire, and C. Kleinerman .NET database programmability and extensibility in Microsoft SQL Server. In Proc. ACM SIGMOD Conference, pages 1087.1098, 2008.
[3]J. Clear, D. Dunn, B. Harvey, M.L. Heytens, and P. Lohman. Non-stop SQL/MX primitives for knowledge discovery. In ACM KDD Conference, pages 425.429, 1999.
[4]E.F. Codd. Extending the database relational model to capture more meaning. ACM TODS, 4(4):397.434, 1979.
[5]C. Cunningham, G. Graefe, and C.A. Galindo-Legaria. PIVOT and UNPIVOT: Optimization and execution strategies in an RDBMS. In Proc. VLDB Conference, pages 998.1009, 2004.
[6]C. Galindo-Legaria and A. Rosenthal. Outer join simpli_cation and reordering for query optimization. ACM TODS, 22(1):43.73, 1997.
Keywords : —Data base, Data Mining, CASE, PIVOT, SPJ.