α-Partitioning Algorithm: Vertical Partitioning Based on the Fuzzy Graph

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 a ects 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.
Publisher
Springer Verlag (Germany)
Issue Date
2001-09
Citation

DEXA 2001, The Twelfth Int'l Conference on Database and Expert Systems Applications, Germany, Munich, P. 538-546

ISBN
3-540-42527-6
URI
http://hdl.handle.net/10203/2024
Link
http://portal.acm.org/citation.cfm?id=648314.755837
Appears in Collection
CS-Conference Papers(학술회의논문)
  • Hit : 618
  • Download : 38
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0