ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Dynamic Optimization of Generalized SQL Queries with Horizontal Aggregations Using K-Means Clustering

Journal: International Journal of Computer Science and Mobile Applications IJCSMA (Vol.2, No. 2)

Publication Date:

Authors : ;

Page : 111-117

Keywords : Aggregation; Data Mining; Structured query language (SQL); PIVOT; K-means algorithm;

Source : Downloadexternal Find it from : Google Scholarexternal


Data mining is widely used domain for extracting trends or patterns from historical data. However, the databases used by enterprises can’t be directly used for data mining. It does mean that Data sets are to be prepared from real world database to make them suitable for particular data mining operations. However, preparing datasets for analyzing data is tedious task as it involves many aggregating columns, complex joins, and SQL queries with sub queries. More over the existing aggregations performed through SQL functions such as MIN, MAX, COUNT, SUM, AVG return a single value output which is not suitable for making datasets meant for data mining. In fact these aggregate functions are generating vertical aggregations. This paper presents techniques to support horizontal aggregations through SQL queries. The result of the queries is the data which is suitable for data mining operations. It does mean that this paper achieves horizontal aggregations through some constructs built that includes SQL queries as well. PIVOT method is much faster method and offers much scalability. Partitioning large set of data, obtained from the result of horizontal aggregation, in to homogeneous cluster is important task in this system. K-means algorithm using SQL is best suited for implementing this operation.

Last modified: 2014-03-01 16:11:05