返回Google圖書搜尋

A Graph Based Cluster Approach for Vertical Partitioning in Database Design

Xuemin LinMaria E. OrlowskaYanchun Zhang

出版	Key Centre for Software Technology, Department of Computer Science, University of Queensland, 1993
URL	http://books.google.com.hk/books?id=4GsftwAACAAJ&hl=&source=gbs_api

註釋Abstract: "In this paper, a new graphical approach to vertical partitioning of a relation is presented. An attribute affinity graph expressed by an affinity matrix can be easily constructed from the set of important and frequently used transactions to the system. This is the input to our partitioning process. The partitioning process has two major steps. In the first phase, a set of clusters on the affinity graph is constructed, where each cluster is a vertex set of a subgraph with a 'strong' connectivity between its vertices. In the second phase, clusters with the 'highest affinity index' are iteratively chosen as fragments. This approach resolves most of the deficiencies of the partitioning algorithm by Navathe-Ra [11]. Moreover it produces better quality results and is more efficient than the approach presented in [10]."