Abstract: Based on the MON-Tree method，a new method，namely the MON⁺-Tree method，is proposed in this paper. The data structure，insertion algorithm and query algorithm are presented.Extensive experiments are conducted to evaluate the performance of the proposed indexing mechanism and show that MON⁺-Tree performs considerably better than MON-Tree and MONC-Tree.

摘要： 基于MON-Tree的思想提出了一种新的索引结构MON⁺-Tree。给出了MON⁺-Tree的数据结构、插入算法和查询算法。最后通过实验MON⁺-Tree、MON-Tree和MONC-Tree进行性能比较，证明MON⁺-Tree为效率更高的查询算法。