Review on Fragment Allocation by using Clustering Technique in Distributed Database System
Priyanka Dash, Ranjita Rout, Satya Bhusan Pratihari, Sanjay Kumar, Padhi

TL;DR
This paper reviews how clustering techniques are used for fragment allocation in distributed database systems, highlighting their role in improving performance by reducing data transfer and access costs.
Contribution
It provides a comprehensive review of clustering-based fragment allocation methods in distributed databases, emphasizing their importance in system performance optimization.
Findings
Clustering techniques help optimize fragment allocation.
They reduce data transfer and access costs.
Simulation tools are effective for evaluating these methods.
Abstract
Considerable Progress has been made in the last few years in improving the performance of the distributed database systems. The development of Fragment allocation models in Distributed database is becoming difficult due to the complexity of huge number of sites and their communication considerations. Under such conditions, simulation of clustering and data allocation is adequate tools for understanding and evaluating the performance of data allocation in Distributed databases. Clustering sites and fragment allocation are key challenges in Distributed database performance, and are considered to be efficient methods that have a major role in reducing transferred and accessed data during the execution of applications. In this paper a review on Fragment allocation by using Clustering technique is given in Distributed Database System.
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
TopicsData Management and Algorithms · Advanced Database Systems and Queries · Graph Theory and Algorithms
