| 摘要: |
| 介绍一种新的方法,该方法能够从原始图结构中通过一种具有例外性的簇化(Aggregation Clustering with Exceptions)手段,获得高层次的关系。这种方法使用的是一个基于已扩展的kernigher-line算法的直接探索法。 |
| 关键词: 簇化 例外 超文本数据库 |
| DOI： |
| 投稿时间：1995-07-23 |
| 基金项目: |
|
| Using Aggregation Clustering to Optimize the Hypertext Database Structure |
|
Huang Yu
|
| (Guangxi New Software Technology Lab., Guangxi Computing Center, 32 Xinghu Road, Nanning, Guangxi, 530022) |
| Abstract: |
| With the hypertext and hypermedia use widely,the information to be managed in hypermedia system become more and more,and the hypermedia database become large and large.Extracting high-level structures is useful for providing a high performance browsing environment as well as efficient physical database design,especially when handling large amounts of data.This paper introduce a new method,ACE(Aggregation Clustering with Exceptions),which generates aggregations and exceptions from the original graph structure in order to capture high-level relationships.This method is based on an extended Kernighan-Lin algorithm. |
| Key words: aggregation and clustering exception hypertext database |
