Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abuelyaman E (2008) An optimized scheme for vertical partitioning of a distributed database. Int J Comput Sci Netw Secur 8(1):310–316
Available: https://www.bcanotes.com/Download/DBMS/Rdbms/DDBMS.pdf
Available: https://www.tutorialcup.com/dbms/data-fragmentation.htm
Ceri S, Negri M, Pelagatti G (1982) Horizontal data partitioning in database design. In: Proc. ACM SIGMOD, pp 128–136
Eźechiel KK, Kant S, Agarwal R (2019) A systematic review on distributed databases systems and their techniques. J Theor Appl Inf Technol 96(1)
Gertz M, Bremer JM (2004) Distributed XML repositories: to-down design and transparent query processing. Department of CS, University of California
Getahun F, Atnafu S, Tekli J, Chbeir R The use of semantic-based predicates implication to improve horizontal multimedia database fragmentation. In: Proceedings of the 1st ACM workshop on the many faces of multimedia semantics, 2007, Bavaria, Germany
Navathe S, Karlapalem K, Ra M (1995) A mixed fragmentation methodology for initial distributed database design. J Comput Softw Eng 3(4):395–426
Navathe SB, Ra M (1989) Vertical partitioning for database design: a graphical algorithm. ACM SIGMOD Rec 18(2):440–450
Navathe SB, Ceri S, Wiederhold G, Dour J (1984) Vertical partitioning algorithms for database design. ACM Trans Database Syst 9(4):680–710
Ng V, Gorla N, Law DM, Chan CK (2003) Applying genetic algorithms in database partitioning. In: Proceedings of the 2003 ACM symposium on applied computing (SAC), pp 544–549
Pinnecke M, Campero Durand G, Broneske D, Zoun R, Saake G (2020) GridTables: a one-size-fits-most H2TAP data store. Datenbank-Spektrum 20:43–56
Raouf AEA, Badr NL, Tolba MF, An optimized scheme for vertical fragmentation, allocation and replication of a distributed database. IEEE Seventh ICICIS’15
Raouf AEA, Badr NL, Tolba MF (2016) An enhanced CRUD for vertical fragmentation allocation and replication over the cloud environment. In: INFOS’16, proceedings of the 10th international conference on informatics and systems, pp 146–152
Rodŕıguez-Mazahua L, Alor-Hernández G, Abud-Figueroa MA, Peĺaez-Camarena SG (2014) Horizontal partitioning of multimedia databases using hierarchical agglomerative clustering. In: Gelbukh A, Espinoza FC, Galicia-Haro SN (eds) Nature-inspired computation and machine learning. MICAI 2014. Lecture notes in computer science, vol 8857. Springer, Cham. https://doi.org/10.1007/978-3-319-13650-9
Singh N, Jain A, Raw RS, Raman R (2014) An apriori-based vertical fragmentation technique for heterogeneous distributed database transactions. In: Intelligent computing, networking, and informatics. Springer, pp 101–109
Song SK, Gorla N (2000) A genetic algorithm for vertical fragmentation and access path selection. Comput J 45(1):81–93
Sub C (2001) An approach to the model-based fragmentation and relational storage of XML-documents. Grundlagen von Datenbanken, 98-102
Vogt M, Stiemer A, Schuldt H Polypheny-DB: towards a distributed and self-adaptive polystore. In: Proceedings of the IEEE international conference on big data (big data 2018), Seattle, WA, USA, 10–13 December 2018, pp 3364–3373
Wiese L (2014) Clustering-based fragmentation and data replication for flexible query answering in dis- tributed databases. J Cloud Comput 3:18. https://doi.org/10.1186/s13677-014-0018-0
Zuhra S, Chaporkar P, Karandikar A (2019) Toward optimal grouping and resource allocation for multicast streaming in LTE. IEEE Trans Veh Technol 68(12):12239–12255. https://doi.org/10.1109/TVT.2019.2945987
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Sharma, D.K., Sinha, U., Gupta, A. et al. Modified minimum spanning tree based vertical fragmentation, allocation and replication approach in distributed multimedia databases. Multimed Tools Appl 81, 37101–37118 (2022). https://doi.org/10.1007/s11042-022-13541-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-022-13541-4