Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM64424
Volume:
10 |
6 |
Jun 2026
Pages:
1-12
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
Computer Science & Engineering
D. Y. Patil School Of Engineering
Computer Science & Engineering
D. Y. Patil School Of Engineering
Computer Science & Engineering
D. Y. Patil School Of Engineering
Computer Science & Engineering
D. Y. Patil School Of Engineering
In data-driven applications, relational databases store data in a normalized vertical format that is not suitable for direct analytical processing or machine learning tasks. Transforming this data into a horizontal, feature-oriented format is essential for effective data mining but often requires complex queries and significant preprocessing time. This paper presents SQL-based horizontal aggregation techniques to efficiently convert vertical datasets into structured, analysis-ready formats. Experimental results demonstrate that horizontal aggregation significantly reduces preprocessing time, simplifies data representation, and improves compatibility with machine learning models such as Decision Trees. Furthermore, the approach enables efficient in-database data transformation, minimizes reliance on external tools, and supports seamless integration with visualization platforms like Power BI. Overall, the system enhances analytical efficiency and provides a scalable solution for preparing datasets for modern data mining and business intelligence applications.
KEYWORDS
The proposed study on horizontal aggregation in SQL for data mining preparation successfully demonstrates that SQL can be effectively used not only for querying but also for efficient data transformation. The research focused on converting vertically structured relational data into a horizontal format using three techniques: CASE, SPJ, and PIVOT. Let the input dataset be represented as: D={(ri,cj,vij)} where ri represents rows (records), cj represents categorical attributes, and vij represents corresponding values. The transformation process converts this vertical structure into a horizontal format: D′={(ri,vi1,vi2,…,vik)} where each category is mapped into a separate column. This transformation significantly improves data usability and reduces preprocessing effort for analytical tasks. From the performance evaluation, the computational efficiency of different methods can be expressed as: · CASE Method: O(n×k) · SPJ Method: O(nlogn) (depending on joins) · PIVOT Method: O(n) The experimental results confirm that the PIVOT method achieves the lowest execution time (0.0056 seconds), validating its linear time complexity behavior. In contrast, the CASE method shows increased computational overhead as the number of categories kkk increases. Additionally, the data transformation reduces the preprocessing complexity required for analytics. If traditional preprocessing requires multiple joins and grouping operations: Traditional≈O(n×k+j) (where j represents join operations), the proposed approach reduces it to: Proposed≈O(n) thus improving overall system efficiency. The integration of visualization modules and AI-powered insights further enhances the practical applicability of the system. Features such as revenue analysis, category performance heatmaps, and automated insight generation demonstrate how horizontally aggregated data supports efficient decision-making. Overall, the study concludes that horizontal aggregation using SQL is a powerful, scalable, and efficient approach for preparing datasets for data mining and business intelligence applications. The combination of theoretical efficiency and practical performance validates the effectiveness of the proposed system.
1. C. Ordonez and Z. Chen, "Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis," IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 4, pp. 678–691, 2012, doi: 10.1109/TKDE.2011.16. P. M. Rathod and A. B. Raut, "Workload Optimization by Horizontal Aggregation in SQL for Data Mining Analysis," International Journal of Scientific Research in Computer Science Engineering and Information Technology, vol. 7, no. 2, pp. 304–309, 2021, doi: 10.32628/CSEIT217263.G. G. Hediyalad and V. H. Prasad, "Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis," International Journal of Engineering Research & Technology (IJERT), vol. 7, no. 5, pp. 1–5, 2018.A. E. Shewale, S. S. Shinde, and P. R. Patil, "Horizontal Aggregations in SQL using CASE, SPJ, and PIVOT Methods for Data Mining Analysis," International Journal of Engineering Research & Technology (IJERT), vol. 3, no. 2, pp. 1–6, 2022.R. Rahman, M. S. Islam, and N. Ahmed, "Creation of Datasets for Data Mining Analysis using Horizontal Aggregation in SQL," International Journal of Computer Applications, vol. 120, no. 3, pp. 45–51, 2021.K. Bagde and P. Rathod, "Efficient Dataset Preparation using SQL Aggregation Techniques," International Journal of Advanced Research in Computer Engineering and Technology, vol. 11, no. 4, pp. 112–118, 2022.Q. Zhang, L. Wang, and Y. Chen, "Data Transformation Techniques for Efficient Data Mining Applications," IEEE Access, vol. 10, pp. 45678–45690, 2022, doi: 10.1109/ACCESS.2022.3156789.S. Rajakumari, K. Priya, and M. Devi, "Efficient Data Mining Dataset Preparation using Aggregation in Relational Databases," International Journal of Computer Applications, vol. 183, no. 21, pp. 1–6, 2022.J. Gray, A. Bosworth, A. Layman, and H. Pirahesh, "Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals," ACM SIGMOD Record, vol. 26, no. 2, pp. 152–159, 1997.A. Kumar, R. Singh, and P. Sharma, "Optimizing SQL Queries for Analytical Workloads in Large Databases," IEEE Transactions on Big Data, vol. 9, no. 1, pp. 145–158, 2023.
Publication Date
6/1/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
1
Total views since publication
PDF Downloads
5
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...