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
Diversity in database reference behavior
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
File structures: theory and practice
File structures: theory and practice
An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases
IEEE Transactions on Software Engineering
On Workload Characterization of Relational Database Environments
IEEE Transactions on Software Engineering
Techniques for Structuring Database Records
ACM Computing Surveys (CSUR)
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
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
Applying Vertical Fragmentation Techniques in Logical Design of Multidimensional Databases
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
alpha-Partitioning Algorithm: Vertical Partitioning Based on the Fuzzy Graph
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Applying genetic algorithms in database partitioning
Proceedings of the 2003 ACM symposium on Applied computing
Materialization of fragmented views in multidimensional databases
Data & Knowledge Engineering
An adaptable vertical partitioning method in distributed systems
Journal of Systems and Software
Research issues in automatic database clustering
ACM SIGMOD Record
Genetic algorithms based approach to database vertical partition
Journal of Intelligent Information Systems
A heuristic approach to cost-efficient fragmentation and allocation of complex value databases
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Optimization of query processing through constrained vertical partitioning of relational tables
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
Distribution design for higher-order data models
Data & Knowledge Engineering
Adaptive Physical Design for Curated Archives
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
A workload-driven unit of cache replacement for mid-tier database caching
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Autonomous database partitioning using data mining on single computers and cluster computers
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Proceedings of the 17th International Database Engineering & Applications Symposium
A comparison of knives for bread slicing
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
An approach to vertical partitioning in relational databases in which the attributes of a relation are partitioned according to a set of transactions is proposed. The objective of vertical partitioning is to minimize the number of disk accesses in the system. Since transactions have more semantic meanings than attributes, this approach allows the optimization of the partitioning based on a selected set of important transactions. An optimal binary partitioning (OBP) algorithm based on the branch and bound method is presented, with the worst case complexity of O(2/sup n/), where n is the number of transactions. To handle systems with a large number of transactions, an algorithm Bpi with complexity varying from O(n) to O(2/sup n/) is also developed. The experimental results reveal that the performance of vertical partitioning is sensitive to the skewness of transaction accesses. Further, BPi converges rather rapidly to OBP. Both OBP and Bpi yield results comparable with that of global optimum obtained from an exhaustive search.