The Community for Technology Leaders
Green Image
Issue No. 04 - April (2012 vol. 24)
ISSN: 1041-4347
pp: 678-691
Zhibo Chen , University of Houston, Houston
Carlos Ordonez , University of Houston, Houston
ABSTRACT
Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables, and aggregating columns. Existing SQL aggregations have limitations to prepare data sets because they return one column per aggregated group. In general, a significant manual effort is required to build data sets, where a horizontal layout is required. We propose simple, yet powerful, methods to generate SQL code to return aggregated columns in a horizontal tabular layout, returning a set of numbers instead of one number per row. This new class of functions is called horizontal aggregations. Horizontal aggregations build data sets with a horizontal denormalized layout (e.g., point-dimension, observation-variable, instance-feature), which is the standard layout required by most data mining algorithms. We propose three fundamental methods to evaluate horizontal aggregations: CASE: Exploiting the programming CASE construct; SPJ: Based on standard relational algebra operators (SPJ queries); PIVOT: Using the PIVOT operator, which is offered by some DBMSs. Experiments with large tables compare the proposed query evaluation methods. Our CASE method has similar speed to the PIVOT operator and it is much faster than the SPJ method. In general, the CASE and PIVOT methods exhibit linear scalability, whereas the SPJ method does not.
INDEX TERMS
Aggregation, data preparation, pivoting, SQL.
CITATION
Zhibo Chen, Carlos Ordonez, "Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis", IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. , pp. 678-691, April 2012, doi:10.1109/TKDE.2011.16
113 ms
(Ver )