Algorithms for vertical partitioning in database physical design

Ch Cheng

Omega, 1994, vol. 22, issue 3, 291-303

Abstract: 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.

Keywords: database; file; fragments; vertical; partitioning; branch; and; bound; clustering (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(94)90042-6
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:22:y:1994:i:3:p:291-303

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().