A graph based cluster approach for vertical partitioning in database design

Lin X., Orlowska M. and Zhang Y. (1993) A graph based cluster approach for vertical partitioning in database design. Data and Knowledge Engineering, 11 2: 151-169. doi:10.1016/0169-023X(93)90003-8


Author Lin X.
Orlowska M.
Zhang Y.
Title A graph based cluster approach for vertical partitioning in database design
Journal name Data and Knowledge Engineering   Check publisher's open access policy
ISSN 0169-023X
Publication date 1993-01-01
Sub-type Article (original research)
DOI 10.1016/0169-023X(93)90003-8
Volume 11
Issue 2
Start page 151
End page 169
Total pages 19
Subject 1702 Cognitive Sciences
Abstract In this paper, a new graphical approach to vertical partitioning of a relation is presented. The proposed algorithm - taking an attribute affinity graph as an input - 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 than the approach presented in [10].
Keyword Attribute affinity
distributed database
fragmentation
graph
partitioning
relational database
transaction
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status Unknown

Document type: Journal Article
Sub-type: Article (original research)
Collection: Scopus Import - Archived
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 22 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 23 Aug 2016, 15:25:24 EST by System User