An examination of cluster identification-based algorithms for vertical partitions

Chun-Hung Cheng and Jaideep Motwani

International Journal of Business Information Systems, 2009, vol. 4, issue 6, 622-638

Abstract: A major objective in database physical design is to minimise disk access in processing database transactions. Vertical partitioning is a major design approach to ensure fewer disk accesses. In this paper, we consider the use of Cluster Identification (CI)-based approaches to produce vertical partitions in database design. To produce partitions, the existing CI-based approaches either remove attributes or duplicate attributes in the branching scheme. It turns out that the former sometimes gives undesirable partitions and that the latter produces overlapping partitions. To overcome these deficiencies, we propose to remove accesses in the branching scheme. Illustrative examples are used to show the effectiveness of this branching scheme. A computational study is also conducted. In addition, the new approach is extended to deal with a vertical partition case considering frequencies of accesses.

Keywords: clustering; cluster identification; branch-and-bound; data partitions; vertical partitions; database design; disk access. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=26695 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijbisy:v:4:y:2009:i:6:p:622-638

Access Statistics for this article

More articles in International Journal of Business Information Systems from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().