This Article 
 Bibliographic References 
 Add to: 
A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems
August 1993 (vol. 19 no. 8)
pp. 804-812

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.

[1] S. Ceri, S. Navathe, and G. Wiederhold, "Distribution design of logical database schemas,"IEEE Trans. Software Eng., vol. SE-9, no. 4, July 1983.
[2] D. W. Cornell and P. S. Yu, "An effective approach to vertical partitioning for physical design of relational databases",IEEE Trans. Software Eng., vol. 16, no. 22, Feb. 1990.
[3] D. W. Cornell and P. S. Yu, "A vertical partitioning algorithm for relational databases," inProc. 3th IEEE Data Eng., 1987.
[4] M. Hammer and B. Niamir, "A heuristic approach to attribute partitioning," inProc. ACM SIGMOD Conf., 1979, pp. 93-101.
[5] J. A. Hoffer, "An integer programming formulation of computer data base design problems,"Inform. Sci., vol. 11, pp. 29-48, 1976.
[6] J. A. Hoffer and D. G. Severance, "The use of cluster analysis in physical database design," inProc. First VLDB, 1975.
[7] J.P. Kearns and S. DeFazio, "Diversity in Database Reference Behavior,"Performance Evaluation Review, Vol. 15, No. 1, May 1989, pp. 11-19.
[8] P. E. Livadas,File Structures: Theory and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1990.
[9] S. T. March, "Techniques for structuring database records,"ACM Comput. Surveys, vol. 15, no. 1, Mar. 1983.
[10] J. Navathe et al., "Vertical Partitioning Algorithms for Database Design,"ACM Trans. Database Systems, Vol. 9, No. 4, Dec. 1984.
[11] S. B. Navathe and M. Ra, "Vertical partitioning for database design: a graphical algorithm," inProc. ACM SIGMOD Int. Conf. on Management of Data, Portland, OR, pp. 440-450, May 1989.
[12] P. Selinger,et al., "Access path selection in a relational data base system," inProc. 1979 ACM-SIGMOD Int. Conf. Management of Data, Boston, MA, June 1979.
[13] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[14] P. S. Yu, M. Chen, H. Heiss, and S. Lee, "On workload characterization of relational databases environments",IEEE Trans. Software Eng., vol. 18, no. 4, Apr. 1992.

Index Terms:
transaction-based approach; vertical partitioning; relational databases; disk accesses; semantic meanings; optimal binary partitioning; OBP; branch and bound method; BPi; complexity; transaction accesses; global optimum; computational complexity; relational databases; transaction processing
W.W. Chu, I.T. Ieong, "A Transaction-Based Approach to Vertical Partitioning for Relational Database Systems," IEEE Transactions on Software Engineering, vol. 19, no. 8, pp. 804-812, Aug. 1993, doi:10.1109/32.238583
Usage of this product signifies your acceptance of the Terms of Use.