Vertical Fragmentation for Database Using FPClose Algorithm

Arwa S. Al-Shannaq, Sultan Almotairi

Abstract

Vertical fragmentation technique is used to enhance the performance of database system and reduce the number of access to irrelevant instances by splitting a table or relation into different fragments vertically. The partitioning design can be derived using FPClose algorithm, which is a data mining algorithm used to extract the frequent closed itemsets in a dataset. A new design approach is implemented to perform fragmentation. A benchmark with different minimum support levels is tested. The obtained results from FPClose algorithm are compared with the Apriori algorithm.

Full Text:

PDF

References

M. Golfarelli, D. Maio, and S. Rizzi, “Vertical Fragmentation of Views in Relational Data Warehouses,” in Atti del Settimo Convegno Nazionale Sistemi Evoluti per Basi di Dati, 1999, pp. 19–33.

Z. Elhoussaine, “Complete Algorithm for fragmentation in Data warehouse,” in 2008 International Conference on Information Resources Management, 2008, no. November 2016, pp. 537–540.

F. Marir, Y. Najjar, M. Y. AlFaress, and H. I. Abdalla, “An enhanced grouping algorithm for vertical partitioning problem in DDBs,” in 22nd International Symposium on Computer and Information Sciences, ISCIS 2007 - Proceedings, 2007, pp. 39–44.

C. Science, “A Comparative Analysis of Fragmentation Selection Algorithms for Data Warehouse Partitioning,” in IEEE International Conference on Advances in Engineering &Technology Research, 2014, pp. 1–5.

H. Mahboubi and J. Darmont, “Enhancing XML Data Warehouse Query Performance by Fragmentation,” in Proceedings of the 2009 ACM symposium on Applied Computing, 2009, no. Section 2, pp. 1555–1562.

S. Yeruva, P. Y. Kumart, and P. Padmanabham, “Design of Distributed Warehouse-A vertical fragmentation approach,” in International Conference on Next Generation Computing Technologies, 2015, no. September, pp. 4–5.

S. Benkrid, L. Bellatreche, and H. Drias, A combined selection of fragmentation and allocation schemes in parallel data warehouses. 2008, pp. 370–374.

N. Gorla and P. W. Y. Betty, “Vertical fragmentation in databases using data mining technique,” Int. J. Data Warehous. Min., vol. 4, no. 3, pp. 35–53, 2008.

G. Grahne and J. Zhu, “High performance mining of maximal frequent itemsets,” 6th Int. Work. High Perform. Data Min., vol. 1, 2003.

M. Bouakkaz, Y. Ouinten, and B. Ziani, Vertical fragmentation of data warehouses using the FP-Max algorithm. 2012, pp. 273–276.

R. Rakesh Kumar and A. Bhanu Prasad, “K Means Clustering Algorithm for Partitioning Data Sets Evaluated From Horizontal Aggregations ,” IOSR J. Comput. Eng. , vol. 12, no. 5, pp. 42–45, 2013.

C. W. Fung, K. Karlapalem, and Q. Li, “An evaluation of vertical class partitioning for query processing in object-oriented databases,” in IEEE Transactions on Knowledge and Data Engineering, 2002, vol. 14, no. 5, pp. 1095–1118.

G. Grahne and J. Zhu, “Fast algorithms for frequent itemset mining using FP-trees,” in IEEE Transactions on Knowledge and Data Engineering, 2005, vol. 17, no. 10, pp. 1347–1362.

M. Lichman, “{UCI} Machine Learning Repository,” 2013. [Online]. Available: http://archive.ics.uci.edu/ml.

P. Fournier-Viger et al., “The SPMF open-source data mining library version 2,” in Proc. 19th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2016), 2016, vol. 9853 LNCS, pp. 36–40.

Refbacks

  • There are currently no refbacks.