Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Vertical partitioning for database design: a graphical algorithm
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
A heuristic approach to attribute partitioning
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems
IEEE Transactions on Software Engineering
Vertical fragmentation in distributed object database systems with complex attributes and methods
DEXA '96 Proceedings of the 7th International Workshop on Database and Expert Systems Applications
The use of cluster analysis in physical data base design
VLDB '75 Proceedings of the 1st International Conference on Very Large Data Bases
A vertical partitioning algorithm for distributed multimedia databases
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
| Hi-index | 0.00 |
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 fragments, which are composed of attributes with high affinity each other. Though a vertical partitioning method should be able to generate arbitrary n fragements as well as all meaningful fragments, previous methods have some limitations to support both of them. In this paper we propose an efficient and flexible vertical partitioning method based on a fuzzy graphs. The method can not only generate all meaningful fragments at a time but also support n-ary partitioning without any complex mathematical computations.