Vertical Fragmentation for Database Using FPClose Algorithm | Zendy

Arwa Sami Al-Shannaq | Zendy; Sultan Almotairi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Vertical Fragmentation for Database Using FPClose Algorithm

Author(s) -

Arwa Sami Al-Shannaq,

Sultan Almotairi

Publication year - 2019

Publication title -

journal of information security and cybercrimes research

Language(s) - English

Resource type - Journals

eISSN - 1658-7782

pISSN - 1658-7790

DOI - 10.26735/16587790.2019.005

Subject(s) - fragmentation (computing) , computer science , algorithm , data mining , benchmark (surveying) , a priori and a posteriori , apriori algorithm , table (database) , database , association rule learning , geography , philosophy , geodesy , epistemology , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research