| M+树:一种新型、高效的动态哈希算法 |
| |
| 引用本文： | 张旺光,庄毅. M+树:一种新型、高效的动态哈希算法[J]. 计算机工程, 2004, 30(16): 94-95,120 |
| |
| 作者姓名： | 张旺光 庄毅 |
| |
| 作者单位： | 杭州电子工学院软件学院,杭州,310037;杭州电子工学院软件学院,杭州,310037 |
| |
| 摘 要： | 通常哈希函数只支持等值查找，这给哈希函数的应用带来了很大的限制。该文提出了一种新型的哈希索引算法——M 树索引。该算法能够支持等值和范围查找，实验表明，该算法无论在查询效率还是可维护性方面都优于同类索引算法。
|
| 关 键 词： | 哈希函数 B+树 M+树索引 |
| 文章编号： | 1000-3428(2004)16-0094-02 |
M+ Tree:A Novel and Effective Dynamic Hash Algorithm |
| |
| ZHANG Wangguang,ZHUANG Yi. M+ Tree:A Novel and Effective Dynamic Hash Algorithm[J]. Computer Engineering, 2004, 30(16): 94-95,120 |
| |
| Authors: | ZHANG Wangguang ZHUANG Yi |
| |
| Abstract: | Generally Hash function could only support keyword search, this gives big limitation to the application of Hash function. The paper presents a novel algorithm which is called Mttree index which supports not only keyword search but the range search. The experiment indicates that this novel approach has a better performance than any other indexing algorithms no matter its query efficiency and indexing maintainability. |
| |
| Keywords: | Hash function B+tree M+tree index |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
