Vertical partitioning algorithms for database design
ACM Transactions on Database Systems (TODS)
Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
Journal of the ACM (JACM)
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Fragmenting Relations Horizontally Using a Knowledge-Based Approach
IEEE Transactions on Software Engineering
Logical and physical support for heterogeneous data
Proceedings of the eleventh international conference on Information and knowledge management
A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems
IEEE Transactions on Software Engineering
Data page layouts for relational databases on deep memory hierarchies
The VLDB Journal — The International Journal on Very Large Data Bases
Weaving Relations for Cache Performance
Proceedings of the 27th International Conference on Very Large Data Bases
A Framework for Automating Physical Database Design
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Applying genetic algorithms in database partitioning
Proceedings of the 2003 ACM symposium on Applied computing
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
Genetic algorithms based approach to database vertical partition
Journal of Intelligent Information Systems
Performance tradeoffs in read-optimized databases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
An examination of cluster identification-based algorithms for vertical partitions
International Journal of Business Information Systems
Fine-grained updates in database management systems for flash memory
Information Sciences: an International Journal
Query Optimization in Encrypted Relational Databases by Vertical Schema Partitioning
SDM '09 Proceedings of the 6th VLDB Workshop on Secure Data Management
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
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
Vertical partitioning for flash and HDD database systems
Journal of Systems and Software
HYRISE: a main memory hybrid storage engine
Proceedings of the VLDB Endowment
A comparison of knives for bread slicing
Proceedings of the VLDB Endowment
| Hi-index | 0.01 |
Vertical partitioning can be used to enhance the performance of relational database systems by reducing the number of disk accesses. The authors identify the key parameters for capturing the behavior of an access plan and propose a two-step methodology consisting of a query analysis step to estimate the parameters and a binary partitioning step which can be applied recursively. The partitioning uses an integer linear programming technique to minimize the number of disk accesses. Significant performance benefit would be achieved for join if the partitioned (inner) relation could fit into the memory buffer under the inner-outer loop join method, or if the partitioned relation could fit into the sort buffer under the sort-merge join method, but not the original relation. For cases where a segment scan or a cluster index scan is used, vertical partitioning of the relation with the algorithm described is still often found to lead to substantial performance improvement.