International Journal of Advanced Studies in Computer Science and Engineering

Open Access Open Access  Restricted Access Subscription Access

Vertical fragmentation and allocation in distributed databases using k-mean algorithm


Affiliations
1 LIM Laboratory, Amar Telidji University of Laghouat, Bp 37G, Ghardaia Road, Laghouat 03000, Algeria., Algeria
 

Distributed database systems are increasingly becoming the dominant tools for data management. However, in these systems, the sites are remote and exchange a huge amount of data, which leads to bottlenecks as well as large disk accesses in data transfers that may be irrelevant. Query processing optimization techniques are an important concern for system administrators to improve the performance of distributed database systems (DDBS). Vertical fragmentation is a suitable solution but its complication lies in the large number of alternatives to obtain an optimal solution. This paper provides a new approach better suited to the problem of vertical fragmentation by the Kmeans classification algorithm but with our new adequate distance. To validate our approach, we compared our solution first with a vertical fragmentation algorithm called VFAR and second with the same k-means algorithm with the hamming distance.

Keywords

Vertical Fragmentation; Distributed Databases; K-Means; Distance.
User
Notifications
Font Size

  • S. Mehta, P. Agarwal, P. Shrivastava, and J. Barlawala, "Differential bond energy algorithm for optimal vertical fragmentation of distributed databases," J. King Saud Univ. Comput. Inf. Sci., vol. 34, pp. 1466-1471, 2018.

  • M. Hammer and B. Niamir, "A heuristic approach to attribute partitioning," in Proceedings of the 1979 ACM SIGMOD international conference on Management of data, 1979, pp. 93-101.

  • N. Rogouschi and Y. Bennani, Classification à base de modèles de mélanges topologiques des données catégorielles et continues, 2009.

  • H. Elghazel and A. D. ), Classification et prévision des données hétérogènes: application aux trajectoires et séjours hospitaliers, 2007.

  • D. Weiss, "Descriptive clustering as a method for exploring text collections," Unpublished doctoral dissertation, Poznan University of Technology, Poznan, Poland, 2006.

  • J. A. Hoffer and D. G. Severance, "The use of cluster analysis in physical data base design," in Proceedings of the 1st International Conference on Very Large Data Bases, 1975, pp. 69-86.

  • W. T. McCormick Jr, P. J. Schweitzer, and T. W. White, "Problem decomposition and data reorganization by a clustering technique," Operations research, vol. 20, pp. 993-1009, 1972.

  • S. Navathe, S. Ceri, G. Wiederhold, and J. Dou, "Vertical partitioning algorithms for database design," ACM Transactions on Database Systems (TODS), vol. 9, pp. 680-710, 1984.

  • S. B. Navathe and M. Ra, "Vertical partitioning for database design: a graphical algorithm," in Proceedings of the 1989 ACM SIGMOD international conference on Management of data, 1989, pp. 440-450.

  • W. W. Chu and I. T. Ieong, "A transaction-based approach to vertical partitioning for relational database systems," IEEE Transactions on Software Engineering, vol. 19, pp. 804-812, 1993.

  • A. S. Al-Shannaq and S. Almotairi, "Vertical Fragmentation for Database Using FPClose Algorithm," Journal of Information Security and Cybercrimes Research, vol. 2, pp. 110-115, 2019.

  • M. Golfarelli, D. Maio, and S. Rizzi, "Vertical Fragmentation of Views in Relational Data Warehouses," in SEBD, 1999, pp. 19-33.

  • S.-K. Song and N. Gorla, "A genetic algorithm for vertical fragmentation and access path selection," The Computer Journal, vol. 43, pp. 81-93, 2000.

  • Z. Elhoussaine, D. Aboutajdine, and A. El Qadi, "Complete algorithm for fragmentation in data warehouse," Age, vol. 1, p. 1, 2008.

  • E. S. Abuelyaman, "An optimized scheme for vertical partitioning of a distributed database," IJCSNS International Journal of Computer Science and Network Security, vol. 8, pp. 310-316, 2008.

  • N. Gorla and P. W. Betty, "Vertical fragmentation in databases using data-mining technique," International Journal of Data Warehousing and Mining (IJDWM), vol. 4, pp. 35-53, 2008

  • H. I. Abdalla, A. A. Amer, and H. Mathkour, "A Novel Vertical Fragmentation, Replication and Allocation Model in DDBSs," J. Univers. Comput. Sci., vol. 20, pp. 1469-1487, 2014.

  • S. Medhavi and A. Kumar, "Valley based vertical partitioning in distributed database," e-Journal of Science & Technology, vol. 10, 2015.

  • S. Agrawal, S. Chaudhuri, L. Kollar, A. Marathe, V. Narasayya, and M. Syamala, "Database tuning advisor for microsoft sql server 2005," in Proceedings of the 2005 ACM SIGMOD international conference on Management of data, 2005, pp. 930-932.

  • G. H. Eladl, "A Modified Vertical Fragmentation Strategy for Distributed Database," 2017.

  • H. Rahimi, F.-A. Parand, and D. Riahi, "Hierarchical simultaneous vertical fragmentation and allocation using modified Bond Energy Algorithm in distributed databases," Applied computing and informatics, vol. 14, pp. 127-133, 2018.

  • B. Ziani, Y. Ouinten, and M. Bouakkaz, "MaxPart: An Efficient Search-Space Pruning Approach to Vertical Partitioning," Computing and Informatics, vol. 37, pp. 915-945, 2018.

  • P. Sathishkumar and M. Gunasekaran, "An improved vertical fragmentation, allocation and replication for enhancing e‐learning in distributed database environment," Computational Intelligence, vol. 37, pp. 253-272, 2021.

  • S. M. a. P. A. a. P. S. a. J. Barlawala, "Differential bond energy algorithm for optimal vertical fragmentation of distributed databases," Journal of King Saud University - Computer and Information Sciences, vol. 34, pp. 1466-1471, 2022.

  • FrancoiseGeandier, "Cours de topologie et analyse Hilbertienne ".

  • J. Darmont, O. Boussaïd, and F. Bentayeb, "DWEB: A Data Warehouse Engineering Benchmark," in International Conference on Data Warehousing and Knowledge Discovery, 2005.

  • TPC-H., "Transaction processing performance council," 2022.

  • A. E. a. B. Abdel Raouf, Nagwa L. and Tolba, M. F., "An optimized scheme for vertical fragmentation, allocation and replication of a distributed database," in 2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS), 2015.


Abstract Views: 251

PDF Views: 69




  • Vertical fragmentation and allocation in distributed databases using k-mean algorithm

Abstract Views: 251  |  PDF Views: 69

Authors

Ahmed Benmelouka
LIM Laboratory, Amar Telidji University of Laghouat, Bp 37G, Ghardaia Road, Laghouat 03000, Algeria., Algeria
Benameur Ziani
LIM Laboratory, Amar Telidji University of Laghouat, Bp 37G, Ghardaia Road, Laghouat 03000, Algeria., Algeria
Youcef Ouinten
LIM Laboratory, Amar Telidji University of Laghouat, Bp 37G, Ghardaia Road, Laghouat 03000, Algeria., Algeria

Abstract


Distributed database systems are increasingly becoming the dominant tools for data management. However, in these systems, the sites are remote and exchange a huge amount of data, which leads to bottlenecks as well as large disk accesses in data transfers that may be irrelevant. Query processing optimization techniques are an important concern for system administrators to improve the performance of distributed database systems (DDBS). Vertical fragmentation is a suitable solution but its complication lies in the large number of alternatives to obtain an optimal solution. This paper provides a new approach better suited to the problem of vertical fragmentation by the Kmeans classification algorithm but with our new adequate distance. To validate our approach, we compared our solution first with a vertical fragmentation algorithm called VFAR and second with the same k-means algorithm with the hamming distance.

Keywords


Vertical Fragmentation; Distributed Databases; K-Means; Distance.

References