| 一种新的优化串行直方图构造算法 |
| |
| 引用本文： | 严君达,王于同. 一种新的优化串行直方图构造算法[J]. 计算机工程与科学, 2003, 25(6): 70-73 |
| |
| 作者姓名： | 严君达 王于同 |
| |
| 作者单位： | 杭州电子工业学院,浙江,杭州,310037 |
| |
| 摘 要： | 串行直方图是基于频度排列对关系进行优化分区构造而成的,其连接结果大小估计是最优的,并可用于等值和范围查询结果大小估计。但是,串行直方图的构造算法复杂,影响了实际应用。本文从实用的角度出发,设计了一种构造优化串行直方图的算法BOS,该算法的时间复杂度大大降低,且估计精度接近最优直方图,从而使其具有较高的实用价值。
|
| 关 键 词： | 串行直方图 构造算法 优化 |
| 文章编号： | 1007-130X(2003)06-0070-04 |
| 修稿时间： | 2002-10-15 |
A New Algorithm of Constructing Optimal Serial Histograms |
| |
| YAN Jim-da,WANG Yu-tong. A New Algorithm of Constructing Optimal Serial Histograms[J]. Computer Engineering & Science, 2003, 25(6): 70-73 |
| |
| Authors: | YAN Jim-da WANG Yu-tong |
| |
| Abstract: | A serial histogram is constructed based on relation frequencies and its join query size estimation is optimal, but its complex algorithm prevents it from application to practical estimations. Here we assume a new algorithm named BOS to solve this problem, and presents both theoretical and experimental results on the new algorithm. |
| |
| Keywords: | serial histogram construction algorithm optimal |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
