A clustering algorithm for hierarchical structures
暂无分享,去创建一个
The problem of determining how to store a hierarchic structure in order to minimize the expected access time to it is examined. A paging environment is assumed. The solution space considered is the set of partitions of the hierarchic structure, each partition being stored in heirarchical order. A very fast algorithm which determines the optimal partition of the tree is described. The algorithm has been used to determine the best partition of an IMS type tree into data set groups as well as to evaluate the cost of different alternatives. Actual measurements against the restructured databases have shown the validity of the model used by this method. The measurements have also shown that selecting the wrong choice of clustering instead of the optimal one may substantially increase the expected access time.
[1] Joseph A. Lukes. Efficient Algorithm for the Partitioning of Trees , 1974, IBM J. Res. Dev..
[2] Dennis G. Severance,et al. The use of cluster analysis in physical data base design , 1975, VLDB '75.
[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[4] Paul A. Jensen,et al. Optimum Network Partitioning , 1971, Oper. Res..
[5] Brian W. Kernighan,et al. Optimal Sequential Partitions of Graphs , 1971, J. ACM.