Issue No. 02 - February (1990 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.44388
<p>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.</p>
vertical partitioning; physical design; relational databases; disk accesses; two-step methodology; query analysis; binary partitioning; integer linear programming; join; sort-merge; segment scan; cluster index scan; linear programming; relational databases; software engineering.
D. Cornell and P. Yu, "An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases," in IEEE Transactions on Software Engineering, vol. 16, no. , pp. 248-258, 1990.