Prediction of Horizontal Data Partitioning Through Query Execution Cost Estimation
Nino Arsov, Goran Velinov, Aleksandar S. Dimovski, Bojana Koteska,, Dragan Sahpaski, Margina Kon-Popovska

TL;DR
This paper introduces a novel, simulation-based method using genetic algorithms to predict optimal horizontal data partitioning schemas that minimize query execution costs without data loading.
Contribution
The paper presents a formal model and a genetic algorithm-based approach for predicting optimal horizontal data partitions to improve system performance.
Findings
Effective in reducing workload execution cost
Validated with PostgreSQL's query optimizer
Demonstrates efficiency and correctness
Abstract
The excessively increased volume of data in modern data management systems demands an improved system performance, frequently provided by data distribution, system scalability and performance optimization techniques. Optimized horizontal data partitioning has a significant influence of distributed data management systems. An optimally partitioned schema found in the early phase of logical database design without loading of real data in the system and its adaptation to changes of business environment are very important for a successful implementation, system scalability and performance improvement. In this paper we present a novel approach for finding an optimal horizontally partitioned schema that manifests a minimal total execution cost of a given database workload. Our approach is based on a formal model that enables abstraction of the predicates in the workload queries, and are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Database Systems and Queries · Data Management and Algorithms · Cloud Computing and Resource Management
