Column generation-based algorithm for fragment allocation: minimizing query splitting in distributed databases

This paper focuses on the fragment allocation problem in distributed databases and proposes an approach that minimizes query splitting. Query splitting occurs when a query has to access multiple servers to retrieve the fragments it needs, resulting in reduced system performance. The objective of min...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information technology and management Jg. 26; H. 4; S. 559 - 572
1. Verfasser: Amiri, Ali
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.12.2025
Springer Nature B.V
Schlagworte:
Algorithms
Business and Management
Cloud computing
Communication
Computer Communication Networks
Concurrency control
Costs
Data Structures and Information Theory
Design
Design optimization
Designers
Fault tolerance
Heuristic
Integer programming
IT in Business
Linear programming
Mathematical programming
Operations Research/Decision Theory
Queries
Response time (computers)
Splitting
Traveling salesman problem
Integer programming
Column generation
Fragment allocation
Query splitting
Distributed databases
ISSN:1385-951X, 1573-7667
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper focuses on the fragment allocation problem in distributed databases and proposes an approach that minimizes query splitting. Query splitting occurs when a query has to access multiple servers to retrieve the fragments it needs, resulting in reduced system performance. The objective of minimizing query splitting is important because it captures many factors that affect the performance of the database, such as reducing response time and cost. The paper presents a column generation-based algorithm to solve the fragment allocation problem, which requires less fine-tuning of its parameters and outperforms the IP approach implemented by CPLEX in terms of the number of queries split and execution time. The approach and algorithm offer practical solutions to optimize the design of a distributed database system. The paper’s contribution is significant as it fills the gap in the literature by offering a novel approach that minimizes query splitting, which can serve as a proxy for achieving a combination of other objectives such as minimizing costs, reducing response time, and balancing server workloads.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1385-951X
1573-7667
DOI:10.1007/s10799-024-00425-2