Algorithms for vertical partitioning in database physical design
An overriding objective in database physical design is to minimize the number of accesses made in the secondary storage when processing transactions. Vertical partitioning is a major step in database physical design to ensure fewer disk accesses. This paper defines the vertical partitioning problem and discusses the limitations of existing clustering algorithms for the problem. A new clustering algorithm is proposed. Our algorithm uses the branch and bound approach. It may use an optimal or heuristic branching scheme and therefore it may generate optimal or approximate solutions. Not only does our algorithm avoid the limitations of existing approaches, but also it performs better than existing algorithms in our comparative study.
Volume (Year): 22 (1994)
Issue (Month): 3 (May)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:22:y:1994:i:3:p:291-303. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.