Adaptive Query-Driven Fragmentation for Performance Optimization in Distributed Databases
DOI:
https://doi.org/10.54361/ajmas.269410Keywords:
Distributed Database, Horizontal Fragmentation, Query Pattern, Derived Fragmentation, Genetic AlgorithmAbstract
Distributed databases improve scalability and availability but introduce challenges related to query performance and data management. Fragmentation is a key technique used to enhance efficiency by reducing irrelevant data access. This paper proposes an adaptive fragmentation approach based on real query patterns to optimize distributed database performance. The method applies horizontal and derived fragmentation techniques driven by frequently executed queries, followed by a genetic algorithm to reduce redundant predicates and minimize fragment growth. The approach was implemented and evaluated using the TPC-H benchmark on a PostgreSQL-based distributed environment. Experimental results demonstrate notable reductions in query response time and communication overhead while maintaining high query coverage. The findings confirm that query-driven adaptive fragmentation can effectively improve distributed database performance and resource utilization.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Zakia Ahmed, Anwar Alhenshiri

This work is licensed under a Creative Commons Attribution 4.0 International License.











