Return
Modified minimum spanning tree based vertical fragmentation, allocation and replication approach in distributed multimedia databases
DOI:10.1007/s11042-022-13541-4.png)
Abstract
En 中文
Distributed Multimedia Database Systems have become an indispensable part of modern world organizations that increased demand for reliable, scalable, and expeditiously accessible information processing systems, data has evolved in multiple media forms having found many application areas across industries that calls for optimal storage, processing and retrieval methodologies in a distributed fashion. The solution mainly relies on the optimization of database design structure in which data fragmentation, allocation and replication play eminent roles. The presented scheme employs a method of vertical fragmentation using enhanced CRUD matrix and Fibonacci heap to efficiently fragment the database into clusters. The fragments are then allocated and replicated at different network nodes depending on the manipulates and reads operation at respective sites, taking into consideration the cost factor. With the use of Fibonacci heap, the amortized complexity of the proposed algorithm has come down to O(E + V log V ) in contrast to the previous works of enhanced Prims algorithm in vertical fragmentation which offered a complexity of O(E log V ) where E denotes the number of edges and V, the number of vertices. This approach generates all the fragments at once and without the use of any predetermined parameters and does not involve the use of a query log. The proposed approach also considers communication and site storage costs for optimal allocation and replication thus minimizing the overall system costs.
Keywords:
Allocation
CRUD
Distributed multimedia database management system (DMDBMS)
Distributed multimedia database system (DMDBS)
Fragmentation
Minimum spanning tree
Replication
Vertical fragmentation
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W

