Abstract

Vertical partitioning is the process of subdividing the attributes of a relation into groups, creating fragments. It represents an effective way of improving performance in the database systems where a significant percentage of query processing time is spent on the full scans of tables. Most of proposed approaches for vertical partitioning in databases use a pairwise affinity to cluster the attributes of a given relation. The affinity measures the frequency of accessing simultaneously a pair of attributes. The attributes having high affinity are clustered together so as to create fragments containing a maximum of attributes with a strong connectivity. However, such fragments can directly and efficiently be achieved by the use of maximal frequent itemsets. This technique of knowledge engineering reflects better the closeness or affinity when more than two attributes are involved. The partitioning process can be done faster and more accurately with the help of such knowledge discovery technique of data mining. In this paper, an approach based on maximal frequent itemsets to vertical partitioning is proposed to efficiently search for an optimized solution by judiciously pruning the potential search space. Moreover, we propose an analytical cost model to evaluate the produced partitions. Experimental studies show that the cost of the partitioning process can be substantially reduced using only a limited set of potential fragments. They also demonstrate the effectiveness of our approach in partitioning small and large tables.

Keywords

Cite this article

@article{cai-3703,
  author  = {Benameur Ziani and Youcef Ouinten and Mustapha Bouakkaz},
  title   = {MaxPart: An Efficient Search-Space Pruning Approach to Vertical Partitioning},
  journal = {Computing and Informatics},
  volume  = {37},
  number  = {4},
  pages   = {915--945},
  year    = {2018},
  issn    = {1335-9150},
  doi     = {10.4149/cai_2018_4_915}
}
Download .bib