The issue of vertical partitioning was extensively studied
with many proposed approaches, which can be applied to the areas where
the match between data and transactions affects performance. Vertical
partitioning is the process of producing groups of attributes, called frag-
ments, which are composed of attributes with high aÆnity each other.
Though a vertical partitioning method should be able to generate arbi-
trary n fragments as well as all meaningful fragments, previous methods
have some limitations to support both of them. In this paper we propose
an eÆcient and
exible vertical partitioning method based on a fuzzy
graph. The method can not only generate all meaningful fragments at
a time but also support n-ary partitioning without any complex mathe-
matical computations.