Distributed databases principles and systems
Distributed databases principles and systems
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
An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases
IEEE Transactions on Software Engineering
Vertical partitioning in database design
Information Sciences—Informatics and Computer Science: An International Journal
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Journal of the ACM (JACM)
A heuristic approach to attribute partitioning
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A Vertical Partitioning Algorithm for Relational Databases
Proceedings of the Third International Conference on Data Engineering
Physical Database Design Using Oracle
Physical Database Design Using Oracle
Integrating vertical and horizontal partitioning into automated physical database design
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
An adaptable vertical partitioning method in distributed systems
Journal of Systems and Software
DB2 design advisor: integrated automatic physical database design
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
An efficient algorithm for mining frequent closed itemsets in dynamic transaction databases
International Journal of Intelligent Systems Technologies and Applications
Modular construction of model partitioning processes for parallel logic simulation
International Journal of Computational Science and Engineering
An evolutionary approach to schema partitioning selection in a data warehouse
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
A genetic algorithm-based clustering approach for database partitioning
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Hi-index | 0.00 |
A major objective in database physical design is to minimise disk access in processing database transactions. Vertical partitioning is a major design approach to ensure fewer disk accesses. In this paper, we consider the use of Cluster Identification (CI)-based approaches to produce vertical partitions in database design. To produce partitions, the existing CI-based approaches either remove attributes or duplicate attributes in the branching scheme. It turns out that the former sometimes gives undesirable partitions and that the latter produces overlapping partitions. To overcome these deficiencies, we propose to remove accesses in the branching scheme. Illustrative examples are used to show the effectiveness of this branching scheme. A computational study is also conducted. In addition, the new approach is extended to deal with a vertical partition case considering frequencies of accesses.