An examination of cluster identification-based algorithms for vertical partitions. (24th June 2009)

• Record Type: Journal Article
• Authors: Cheng, Chun-Hung; Motwani, Jaideep
• Is Part Of: International journal of business information systems. Volume 4:Number 6(2009)
• Page Start: 622
• Page End: 638
• Publication Date: 2009-06-24
• Subjects: clustering -- cluster identification -- branch-and-bound -- data partitions -- vertical partitions -- database design -- disk access; Information storage and retrieval systems -- Business -- Periodicals; Business -- Data processing -- Periodicals; Management information systems -- Periodicals; System design -- Periodicals; System analysis -- Periodicals; 651.8
• Languages: English
• ISSNs: 1746-0972

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.