Fragment Allocation Configuration in Distributed Database Systems
Mohammad Reza Abbasifard, Omid Isfahani Alamdari

TL;DR
This paper demonstrates that declarative programming languages can effectively model and simplify data fragment allocation techniques in distributed database systems, facilitating easier development and potential optimizations.
Contribution
It introduces a novel approach using logic programming languages to represent and potentially improve fragment allocation algorithms in distributed databases.
Findings
Declarative languages simplify fragment allocation representation
The approach can be extended to other distributed system areas
Potential for further development and optimization
Abstract
In distributed database (DDB) management systems, fragment allocation is one of the most important components that can directly affect the performance of DDB. In this research work, we will show that declarative programming languages, e.g. logic programming languages, can be used to represent different data fragment allocation techniques. Results indicate that, using declarative programming language significantly simplifies the representation of fragment allocation algorithm, thus opens door for any further developments and optimizations. The under consideration case study also show that our approach can be extended to be used in different areas of distributed systems.
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 · Logic, Reasoning, and Knowledge
