M+树:一种新型、高效的动态哈希算法  

M+ Tree: A Novel and Effective Dynamic Hash Algorithm

作　　者：张旺光[1] 庄毅[1] 

机构地区：[1]杭州电子工学院软件学院,杭州310037

出　　处：《计算机工程》2004年第16期94-95,120,共3页Computer Engineering

摘　　要：通常哈希函数只支持等值查找,这给哈希函数的应用带来了很大的限制。该文提出了一种新型的哈希索引算法——M+树索引。该算法能够支持等值和范围查找。实验表明,该算法无论在查询效率还是可维护性方面都优于同类索引算法。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.

关 键 词：哈希函数 B+树 M+树索引 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]